How to Modify Polar Codes for List Decoding

Polar codes are constructed based on the reliability of bit-channels. This construction suits the successive cancellation (SC) decoding, where one error in the successive estimation of the bits fails the decoding. However, in SC list (SCL) decoding, the correct path may remain in the list by tolerating multiple penalties. This characteristic of list decoding demands a different approach in code construction.In this work, we modify the conventional construction by a greedy search algorithm in which a bit-swapping approach is employed to re-distribute the low-reliability bits in the subblocks aiming for a reduction in the probability of correct path elimination. The numerical results for polar codes of length 1 kb under CRC-aided SCL decoding show improvements of about 0.4 dB for R=0.8 and over 0.2 dB for R=0.5 at L=32.

[1]  Ryuhei Mori,et al.  Performance and construction of polar codes on symmetric binary-input memoryless channels , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  Jun Wang,et al.  Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[3]  Paul H. Siegel,et al.  Polar Code Constructions Based on LLR Evolution , 2017, IEEE Communications Letters.

[4]  Peter Trifonov,et al.  Efficient Design and Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

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

[6]  Alexios Balatsoukas-Stimming,et al.  LLR-Based Successive Cancellation List Decoding of Polar Codes , 2013, IEEE Transactions on Signal Processing.

[7]  Peter Trifonov,et al.  A randomized construction of polar subcodes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[9]  Christian Schürch,et al.  A partial order for the synthesized channels of a polar code , 2016, ISIT.

[10]  Rüdiger L. Urbanke,et al.  Construction of polar codes with sublinear complexity , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[11]  Emanuele Viterbo,et al.  Stepped List Decoding for Polar Codes , 2018, 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC).

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