A Novel Interleaving Scheme for Polar Codes

It's known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. We call the coupled information bits the correlated bits. In this paper, concatenation schemes are studied for polar codes and LDPC codes. In a conventional concatenation scheme, to achieve a better BER performance, one can divide all $N_l$ bits in a LDPC block into $N_l$ polar blocks to completely de-correlate the possible coupled errors. In this paper, we propose a novel interleaving scheme between a LDPC code and a polar code which breaks the correlation of the errors among the correlated bits. This interleaving scheme still keeps the simple SC decoding of polar codes while achieves a better BER performance than a direct concatenation of polar codes (with BP decoding) with LDPC codes. The proposed scheme also achieves a comparable BER performance (0.5dB difference) at a much smaller delay compared with a $N_l$-block delay scheme.

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

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

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

[4]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[5]  Erdal Arikan,et al.  Systematic Polar Coding , 2011, IEEE Communications Letters.

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

[7]  Liping Li,et al.  On the Error Performance of Systematic Polar Codes , 2015, ArXiv.

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

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

[10]  Kai Chen,et al.  Improved Successive Cancellation Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

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

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