Polar Code Constructions Based on LLR Evolution

Polar code constructions based on mutual information or Bhattacharyya parameters of bit-channels are intended for hard-output successive cancellation (SC) decoders, and thus might not be well designed for use with other decoders, such as soft-output belief propagation (BP) decoders or successive cancellation list (SCL) decoders. In this letter, we use the evolution of messages, i.e., log-likelihood ratios, of unfrozen bits during iterative BP decoding of polar codes to identify weak bit-channels, and then modify the conventional polar code construction by swapping these bit-channels with strong frozen bit-channels. The modified codes show improved performance not only under BP decoding, but also under SCL decoding. The code modification is shown to reduce the number of low-weight codewords, with and without CRC concatenation.

[1]  Rudiger Urbanke,et al.  From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length Performance , 2014, IEEE Trans. Commun..

[2]  Johannes B. Huber,et al.  Improving successive cancellation decoding of polar codes by usage of inner block codes , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.

[3]  Rüdiger L. Urbanke,et al.  From polar to Reed-Muller codes: A technique to improve the finite-length performance , 2014, 2014 IEEE International Symposium on Information Theory.

[4]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  H. Pishro-Nik,et al.  On bit error rate performance of polar codes in finite regime , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[7]  Yu-Chih Huang,et al.  Interleaved Concatenations of Polar Codes With BCH and Convolutional Codes , 2016, IEEE Journal on Selected Areas in Communications.

[8]  Paul H. Siegel,et al.  Enhanced belief propagation decoding of polar codes through concatenation , 2014, 2014 IEEE International Symposium on Information Theory.

[9]  Bin Li,et al.  An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy Check , 2012, IEEE Communications Letters.

[10]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[11]  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.

[12]  E. Arkan,et al.  A performance comparison of polar codes and Reed-Muller codes , 2008, IEEE Communications Letters.

[13]  Paul H. Siegel,et al.  Numerical issues affecting LDPC error floors , 2012, 2012 IEEE Global Communications Conference (GLOBECOM).

[14]  Mayank Bakshi,et al.  Concatenated Polar codes , 2010, 2010 IEEE International Symposium on Information Theory.

[15]  John R. Barry,et al.  Polar codes for partial response channels , 2013, 2013 IEEE International Conference on Communications (ICC).