Rate-Constrained Simulation and Source Coding IID Sources
Information Theory
2011-02-24 v2 math.IT
Abstract
Necessary conditions for asymptotically optimal sliding-block or stationary codes for source coding and rate-constrained simulation of memoryless sources are presented and used to motivate a design technique for trellis-encoded source coding and rate-constrained simulation. The code structure has intuitive similarities to classic random coding arguments as well as to ``fake process'' methods and alphabet-constrained methods. Experimental evidence shows that the approach provides comparable or superior performance in comparison with previously published methods on common examples, sometimes by significant margins.
Cite
@article{arxiv.1008.2008,
title = {Rate-Constrained Simulation and Source Coding IID Sources},
author = {Mark Z. Mao and Robert M. Gray and Tamas Linder},
journal= {arXiv preprint arXiv:1008.2008},
year = {2011}
}
Comments
To appear in the IEEE Transactions on Information Theory, 13 pages