Low-Complexity Soft-Output Decoding of Polar Codes

The state-of-the-art soft-output decoder for polar codes is a message-passing algorithm based on belief propagation, which performs well at the cost of high processing and storage requirements. In this paper, we propose a low-complexity alternative for soft-output decoding of polar codes that offers better performance but with significantly reduced processing and storage requirements. In particular we show that the complexity of the proposed decoder is only 4% of the total complexity of the belief propagation decoder for a rate one-half polar code of dimension 4096 in the dicode channel, while achieving comparable error-rate performance. Furthermore, we show that the proposed decoder requires about 39% of the memory required by the belief propagation decoder for a block length of 32768.

[1]  Seungjune Jeon,et al.  Performance and Complexity of 32 k-bit Binary LDPC Codes for Magnetic Recording Channels , 2010, IEEE Transactions on Magnetics.

[2]  John Cocke,et al.  Optimal decoding of linear codes for minimizing symbol error rate (Corresp.) , 1974, IEEE Trans. Inf. Theory.

[3]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.

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

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

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

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

[8]  Gerhard Fettweis,et al.  Reduced Complexity LDPC Decoding using Forced Convergence , 2004 .

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

[10]  Alain Glavieux,et al.  Iterative correction of intersymbol interference: Turbo-equalization , 1995, Eur. Trans. Telecommun..

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

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

[13]  William E. Ryan,et al.  Design of efficiently encodable moderate-length high-rate irregular LDPC codes , 2004, IEEE Transactions on Communications.

[14]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .

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

[16]  Tong Zhang,et al.  Area-Efficient Min-Sum Decoder Design for High-Rate Quasi-Cyclic Low-Density Parity-Check Codes in Magnetic Recording , 2007, IEEE Transactions on Magnetics.

[17]  R. M. Tanner,et al.  A Class of Group-Structured LDPC Codes , 2001 .

[18]  Alexander Vardy,et al.  Hardware architectures for successive cancellation decoding of polar codes , 2010, 2011 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[19]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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