How to Construct Polar Codes

A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows exponentially with the code length. Thus, the core problem that needs to be solved is that of faithfully approximating a bit-channel with an intractably large alphabet by another channel having a manageable alphabet size. We devise two approximation methods which “sandwich” the original bit-channel between a degraded and an upgraded version thereof. Both approximations can be efficiently computed and turn out to be extremely close in practice. We also provide theoretical analysis of our construction algorithms, proving that for any fixed ε > 0 and all sufficiently large code lengths n, polar codes whose rate is within ε of channel capacity can be constructed in time and space that are both linear in n.

[1]  R. Gallager.  Information Theory and Reliable Communication , 1968 .

[2]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[3]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

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

[5]  Rüdiger L. Urbanke,et al.  Polar codes: Characterization of exponent, bounds, and constructions , 2009, 2009 IEEE International Symposium on Information Theory.

[6]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

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

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

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

[10]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[11]  Ryuhei Mori.  Properties and Construction of Polar Codes , 2010, ArXiv.

[12]  Erdal Arikan,et al.  Source polarization , 2010, 2010 IEEE International Symposium on Information Theory.

[13]  Emre Telatar,et al.  Polar Codes for the m-User MAC and Matroids , 2010, ArXiv.

[14]  Alexander Vardy,et al.  Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes , 2010, IEEE Transactions on Information Theory.

[15]  Emre Telatar,et al.  Polar Codes for the m-User MAC , 2010 .

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

[17]  Eren Sasoglu.  Polarization in the presence of memory , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[19]  Extracting randomness and dependencies via a matrix polarization , 2011, ArXiv.

[20]  Brian M. Kurkoski,et al.  Quantization of Binary-Input Discrete Memoryless Channels, with Applications to LDPC Decoding , 2011, ArXiv.

[21]  Rüdiger L. Urbanke,et al.  Universal bounds on the scaling behavior of polar codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[22]  David Burshtein,et al.  Polar write once memory codes , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[23]  Emre Telatar,et al.  Polar Codes for the Two-User Multiple-Access Channel , 2010, IEEE Transactions on Information Theory.

[24]  V. Guruswami,et al.  Polar Codes: Speed of Polarization and Polynomial Gap to Capacity , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[25]  Toshiyuki Tanaka,et al.  Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization , 2011, IEEE Transactions on Information Theory.

[26]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[27]  Emmanuel Abbe,et al.  Randomness and Dependencies Extraction via Polarization, With Applications to Slepian–Wolf Coding and Secrecy , 2011, IEEE Transactions on Information Theory.