A new code construction for polar codes using min-sum density

Polar codes are capacity achieving codes for binary-input symmetric memoryless channels (B-SMCs) if the code word length tends to infinity. Its encoding and decoding complexity is low. However, low complexity in code construction holds only for some special B-SMCs like the binary erasure channel (BEC). For all other B-SMCs, the code construction becomes a trade off between low complexity and construction accuracy. This paper gives an overview on the most popular code construction methods including a new approach yielding to near optimum code construction while reducing the complexity and increasing robustness against numerical problems. In addition, we compare the performance of the presented methods in terms of frame error rates (FERs) for codes of length 2048.

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

[2]  Joachim Hagenauer.  Soft is Better Than Hard , 1994 .

[3]  Emre Telatar,et al.  On the construction of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Robert J. Beaver,et al.  An Introduction to Probability Theory and Mathematical Statistics , 1977 .

[5]  Achilleas Anastasopoulos,et al.  A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

[7]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .

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

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

[10]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

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

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

[13]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

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

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