Improving Belief Propagation decoding of polar codes using scattered EXIT charts

For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been successfully applied in the literature, and is straightforward to be used in combination with Successive Cancellation List (SCL) decoding. Belief Propagation (BP) decoding, however, offers more potential for exploiting parallelism in hardware implementation, and thus, we focus our attention on improving the BP decoder. Specifically, similar to the CRC strategy in the SCL-case, we use a short-length “auxiliary” LDPC code together with the polar code to provide a significant improvement in terms of BER. We present the novel concept of “scattered” EXIT charts to design such auxiliary LDPC codes, and achieve net coding gains (i.e. for the same total rate) of 0.4dB at BER of 10-5 compared to the conventional BP decoder.

[1]  Alptekin Pamuk,et al.  An FPGA implementation architecture for decoding of polar codes , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[2]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

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

[4]  Hossein Pishro-Nik,et al.  A practical approach to polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Jungwon Lee,et al.  On the construction and decoding of concatenated polar codes , 2013, 2013 IEEE International Symposium on Information Theory.

[6]  Stephan ten Brink,et al.  Design of low-density parity-check codes for modulation and detection , 2004, IEEE Transactions on Communications.

[7]  Xiaohu You,et al.  Efficient adaptive list successive cancellation decoder for polar codes , 2014, 2014 48th Asilomar Conference on Signals, Systems and Computers.

[8]  Alexander Vardy,et al.  Increasing the speed of polar list decoders , 2014, 2014 IEEE Workshop on Signal Processing Systems (SiPS).

[9]  Stephan ten Brink,et al.  Convergence behavior of iteratively decoded parallel concatenated codes , 2001, IEEE Trans. Commun..

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

[11]  Alexander Vardy,et al.  Fast List Decoders for Polar Codes , 2015, IEEE Journal on Selected Areas in Communications.

[12]  Kai Chen,et al.  Polar codes: Primary concepts and practical decoding algorithms , 2014, IEEE Communications Magazine.

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

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

[15]  Zhengya Zhang,et al.  A 4.68Gb/s belief propagation polar decoder with bit-splitting register file , 2014, 2014 Symposium on VLSI Circuits Digest of Technical Papers.

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

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

[18]  Gwan S. Choi,et al.  XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes , 2014, 2015 IEEE Global Communications Conference (GLOBECOM).