Arithmetic Distribution Matching
Conference: SCC 2015 - 10th International ITG Conference on Systems, Communications and Coding
02/02/2015 - 02/05/2015 at Hamburg, Germany
Pages: 6Language: englishTyp: PDFPersonal VDE Members are entitled to a 10% discount on this title
Baur, Sebastian; Boecherer, Georg (Institute for Communications Engineering, Technische Universität München, Germany)
In this work, arithmetic distribution matching (ADM) is presented. ADM invertibly transforms a discrete memoryless source (DMS) into a target DMS. ADM can be used for probabilistic shaping and for rate adaption. Opposed to existing algorithms for distribution matching, ADM works online and can transform arbitrarily long input sequences. It is shown analytically that as the input length tends to infinity, the ADM output perfectly emulates the target DMS with respect to the normalized informational divergence and the entropy rate. Numerical results are presented that confirm the analytical bounds.