Constant Composition Distribution Matching

被引：541

作者：

Schulte, Patrick ^{[1
]}

Boecherer, Georg ^{[1
]}

机构：

[1] Tech Univ Munich, Inst Commun Engn, D-80333 Munich, Germany

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2016年 / 62卷 / 01期

关键词：

Distribution matching; fixed length; arithmetic coding; asymptotically optimal algorithm;

D O I：

10.1109/TIT.2015.2499181

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Distribution matching transforms independent and Bernoulli(1/2) distributed input bits into a sequence of output symbols with a desired distribution. Fixed-to-fixed length, invertible, and low complexity encoders and decoders based on constant composition and arithmetic coding are presented. The encoder achieves the maximum rate, namely, the entropy of the desired distribution, asymptotically in the blocklength. Furthermore, the normalized divergence of the encoder output and the desired distribution goes to zero in the blocklength.

引用

页码：430 / 434

页数：5

共 20 条

[1]

Amjad R. A., 2013, THESIS TU MUNCHEN MU

[2]

Amjad RA, 2013, IEEE INT SYMP INFO, P1511, DOI 10.1109/ISIT.2013.6620479

[3]

[Anonymous], 2011, INFORM THEORY CODING, DOI DOI 10.1017/CBO9780511921889

[4]

Baur N., 2015, P 10 INT ITG C SYST, P1

[5]

Bocherer G., 2011, IEEE Information Theory Workshop (ITW 2011), P330, DOI 10.1109/ITW.2011.6089473

[6]

Bocherer G., 2015, OPTIMAL QUANTIZATION

[7] Matching Dyadic Distributions to Channels [J].

Boecherer, G. ;

Mathar, R. .

2011 DATA COMPRESSION CONFERENCE (DCC), 2011, :23-32

[8] Bandwidth Efficient and Rate-Matched Low-Density Parity-Check Coded Modulation [J].

Boecherer, Georg ;

Steiner, Fabian ;

Schulte, Patrick .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2015, 63 (12) :4651-4665

[9]

Böcherer G, 2014, IEEE INT SYMP INFO, P176, DOI 10.1109/ISIT.2014.6874818

[10] Probabilistic capacity and optimal coding for asynchronous channel [J].

Cai, Ning ;

Ho, Siu-Wai ;

Yeung, Raymond W. .

2007 IEEE INFORMATION THEORY WORKSHOP, VOLS 1 AND 2, 2007, :54-+

← 1 2 →