Quantization of Binary-Input Discrete Memoryless Channels

DOI10.1109/TIT.2014.2327016MaRDI QIDQ2986204zbMATH OpenOpenAlexFDO

Authors Brian M. Kurkoski, Hideki Yagi

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Abstract: The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm which finds an optimal quantizer, in the sense of maximizing mutual information between the channel input and the quantizer output is given. This result holds for arbitrary channels, in contrast to previous results for restricted channels or a restricted number of quantizer outputs. In the worst case, the algorithm complexity is cubic $M^3$ in the number of channel outputs $M$. Optimality is proved using the theorem of Burshtein, Della Pietra, Kanevsky, and N'adas for mappings which minimize average impurity for classification and regression trees.

Cited in

(3)

• Quantizers with uniform decoders and channel-optimized encoders
• On the cost of finite block length in quantizing unbounded memoryless sources
• Memory efficient adaptation of vector quantizers to time-varying channels

This page was built for publication: Quantization of Binary-Input Discrete Memoryless Channels

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