Entropy-Constrained Maximizing Mutual Information Quantization
Information Theory
2020-01-08 v1 math.IT
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.
Keywords
Cite
@article{arxiv.2001.01830,
title = {Entropy-Constrained Maximizing Mutual Information Quantization},
author = {Thuan Nguyen and Thinh Nguyen},
journal= {arXiv preprint arXiv:2001.01830},
year = {2020}
}