vix.ing · top · new · best · stats · spec

Entropy-Constrained Maximizing Mutual Information Quantization

2020/01/07 by Thuan Nguyen, Thinh Nguyen, Nguyen, Thuan +1
Computer Science · #Advanced Data Compression Techniques #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Neural Networks and Applications

paper · pdf · doi:10.48550/arxiv.2001.01830

openalex publication_date 2020/01/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper, we investigate the quantization of the output of a binary input discrete memoryless channel that maximizing the mutual information between the input and the quantized output under an entropy-constrained of the quantized output. A polynomial time algorithm is introduced that can find the truly global optimal quantizer. These results hold for binary input channels with an arbitrary number of quantized output. Finally, we extend these results to binary input continuous output channels and show a sufficient condition such that a single threshold quantizer is an optimal quantizer. Both theoretical results and numerical results are provided to justify our techniques.

Citations

Related