Quantization of Binary-Input Discrete Memoryless Channels
Authors:
Top Cited Papers
- 2 June 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 60 (8) , 4544-4552
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 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ádas for mappings, which minimize average impurity for classification and regression trees.Keywords
All Related Versions
Funding Information
- Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (C) (23560439)
- Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Young Scientists (B) (22760270)
- Japan Science and Technology Agency, Special Coordination Funds for Promoting Science and Technology
This publication has 22 references indexed in Scilit:
- Finding the capacity of a quantized binary-input DMC2012
- Channel quantizers that maximize random coding exponents for binary-input memoryless channels2012
- Communication Limits with Low Precision Analog-to-Digital Conversion at the Receiver2007
- On quantization of low-density parity-check coded channel measurements2005
- Minimum Impurity PartitionsThe Annals of Statistics, 1992
- Optimal partitioning for classification and regression treesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1991
- Methods for Global Concave Minimization: A Bibliographic SurveySIAM Review, 1986
- On optimal soft-decision demodulationIEEE Transactions on Information Theory, 1976
- Computation of channel capacity and rate-distortion functionsIEEE Transactions on Information Theory, 1972
- Modulation and demodulation for probabilistic codingIEEE Transactions on Information Theory, 1966