Constant Composition Distribution Matching
Information Theory
2015-03-18 v1 math.IT
Abstract
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. Asymptotically in the blocklength, the encoder achieves the maximum rate, namely the entropy of the desired distribution. Furthermore, the normalized divergence of the encoder output and the desired distribution goes to zero in the blocklength.
Keywords
Cite
@article{arxiv.1503.05133,
title = {Constant Composition Distribution Matching},
author = {Patrick Schulte and Georg Böcherer},
journal= {arXiv preprint arXiv:1503.05133},
year = {2015}
}
Comments
5 pages, 5 figures