Optimal Quantization for Distribution Synthesis

DOI10.1109/TIT.2016.2610433MaRDI QIDQ2976493zbMATH OpenFDO

Authors Georg Böcherer, Bernhard C. Geiger

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1307.6843

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: Finite precision approximations of discrete probability distributions are considered, applicable for distribution synthesis, e.g., probabilistic shaping. Two algorithms are presented that find the optimal $M$-type approximation $Q$ of a distribution $P$ in terms of the variational distance $|Q-P{|}_1$ and the informational divergence $mathbbD(Q|P)$. Bounds on the approximation errors are derived and shown to be asymptotically tight. Several examples illustrate that the variational distance optimal approximation can be quite different from the informational divergence optimal approximation.

Cited in

(4)

• Optimal quantization for mixed distributions
• scientific article; zbMATH DE number 4213202 (Why is no real title available?)
• Automatic Generation of Optimal Reductions of Distributions
• Probabilistic Amplitude Shaping

This page was built for publication: Optimal Quantization for Distribution Synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976493)