Suboptimal quantizer design for outputs of discrete memoryless channels with a finite-input alphabet

Some quantization techniques are used in practice system to reduce the complexity of coding problem. Kurkoski, Yamaguchi, and Kobayashi proposed a suboptimal algorithm that design a channel output quantizer in the sense of maximizing mutual information between the channel input and the quantizer output for any finite-input discrete memoryless channels and fixed channel input distribution by using greedy algorithm. Moreover, Kurkoski and Yagi considered only binary-input case, and proposed an algorithm for finding the optimal quantizer design of channel output for any binary-input discrete memoryless channel and fixed channel input distribution by using dynamic programming. In this paper, we evaluate the precision of the former algorithm proposed by Kurkoski, Yamaguchi, and Kobayashi.

[1]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[2]  Imre Csiszár,et al.  Context tree estimation for not necessarily finite memory processes, via BIC and MDL , 2005, IEEE Transactions on Information Theory.

[3]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[4]  Alexander Vardy,et al.  Constructing polar codes for non-binary alphabets and MACs , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[5]  Brian M. Kurkoski,et al.  Noise Thresholds for Discrete LDPC Decoding Mappings , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.

[6]  Brian M. Kurkoski,et al.  Quantization of Binary-Input Discrete Memoryless Channels , 2011, IEEE Transactions on Information Theory.

[7]  Hideki Yagi,et al.  Concatenation of a discrete memoryless channel and a quantizer , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[8]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[9]  T. Aaron Gulliver,et al.  Upgraded Approximation of Non-Binary Alphabets for Polar Code Construction , 2013, ArXiv.

[10]  Ken-ichi Iwata,et al.  Quantizer design for outputs of binary-input discrete memoryless channels using SMAWK algorithm , 2014, 2014 IEEE International Symposium on Information Theory.