Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 62, Issue 1, Pages 430-434Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2015.2499181
Keywords
Distribution matching; fixed length; arithmetic coding; asymptotically optimal algorithm
Funding
- German Federal Ministry of Education and Research
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available