Towards high performance short polar codes: Concatenated with the spinal codes

As the first ever provably capacity achieving codes, Polar codes have drawn a wide range of research interests in recent years. It is well known that short/finite-length Polar codes have relatively not so good bit error rate (BER) performance as the state-of-the-art channel codes (e.g. Turbo codes, LDPC). One commonly used way to improve the performance of short Polar codes is to concatenate the Polar codes with outer codes, but the amount of improvement is largely constrained by the performance of the outer codes with short codeword length. Motivated by this, in this work, we propose to use the newly invented Spinal codes, which has high performance with short code length, as the outer codes. Specifically, the designed codes, named as Spinal-Polar, is implemented through an interleaved concatenation scheme. In addition, we propose a joint iterative decoding algorithm for SpinalPolar, and the decoding complexity is analyzed theoretically. Extensive simulations are carried out, and results show that the proposed concatenation scheme can significantly improve the BER performance of short Polar codes.

[1]  Devavrat Shah,et al.  Spinal codes , 2012, CCRV.

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

[3]  Michael Gastpar,et al.  On LP decoding of polar codes , 2010, 2010 IEEE Information Theory Workshop.

[4]  Ying Li,et al.  A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes , 2015, IEEE Communications Letters.

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

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

[7]  K. Niu,et al.  Stack decoding of polar codes , 2012 .

[8]  Cornelius T. Healy,et al.  Short-length Low-density Parity-check Codes: Construction and Decoding Algorithms , 2014 .

[9]  Peter Trifonov,et al.  Generalized concatenated codes based on polar codes , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[10]  Kai Chen,et al.  CRC-Aided Decoding of Polar Codes , 2012, IEEE Communications Letters.

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

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

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

[14]  Jungwon Lee,et al.  Performance Limits and Practical Decoding of Interleaved Reed-Solomon Polar Concatenated Codes , 2013, IEEE Transactions on Communications.