Convolutional Polar Codes

Arikan's Polar codes attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by 1/2. Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping the bloc-structured kernel. Recently, two of us introduced a new family of efficiently decodable error-correction codes based on a recently discovered efficiently-contractible tensor network family in quantum many-body physics, called branching MERA. These codes, called branching MERA codes, include Polar codes and also extend them in a non-trivial way by substituting the bloc-structured kernel by a convolutional structure. Here, we perform an in-depth study of a particular example that can be thought of as a direct extension to Arikan's Polar code, which we therefore name Convolutional Polar codes. We prove that these codes polarize and exponentially suppress the channel's error probability, with an asymptotic error exponent log_2(3)/2 which is provably better than for Polar codes under successive cancellation decoding. We also perform finite block-size numerical simulations which display improved error-correcting capability with only a minor impact on decoding complexity.

[1]  Igor L. Markov,et al.  Simulating Quantum Computation by Contracting Tensor Networks , 2008, SIAM J. Comput..

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

[3]  Saikat Guha,et al.  Polar Codes for Classical-Quantum Channels , 2011, IEEE Transactions on Information Theory.

[4]  Alexander Vardy,et al.  Achieving the secrecy capacity of wiretap channels using Polar codes , 2010, ISIT.

[5]  Rüdiger L. Urbanke,et al.  Universal polar codes , 2013, 2014 IEEE International Symposium on Information Theory.

[6]  Gerhard Lakemeyer,et al.  Exploring artificial intelligence in the new millennium , 2003 .

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

[8]  R. Urbanke,et al.  Polar codes are optimal for lossy source coding , 2009 .

[9]  Emre Telatar,et al.  A simple proof of polarization and polarization for non-stationary channels , 2014, 2014 IEEE International Symposium on Information Theory.

[10]  Erdal Arikan Bilkent.  Polar coding for the Slepian-Wolf problem based on monotone chain rules , 2012, ISIT 2012.

[11]  F. Verstraete,et al.  Renormalization algorithms for Quantum-Many Body Systems in two and higher dimensions , 2004, cond-mat/0407066.

[12]  Lele Wang,et al.  Universal polarization , 2014, ISIT.

[13]  G. David Forney,et al.  Partition Functions of Normal Factor Graphs , 2011, ArXiv.

[14]  Xiao-Gang Wen,et al.  Tensor-entanglement renormalization group approach as a unified method for symmetry breaking and topological phase transitions , 2008 .

[15]  Xiao-Gang Wen,et al.  Tensor-entanglement renormalization group approach as a unified method for symmetry breaking and topological phase transitions , 2008, 0806.3509.

[16]  David J. C. MacKay,et al.  Information Theory, Inference, and Learning Algorithms , 2004, IEEE Transactions on Information Theory.

[17]  John C. Baez,et al.  Categories in Control , 2014, 1405.6881.

[18]  Christoph Hirche,et al.  Polar codes in quantum information theory , 2015, ArXiv.

[19]  Jacob D. Biamonte,et al.  Categorical Tensor Network States , 2010, ArXiv.

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

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

[22]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-I , 1973, IEEE Trans. Inf. Theory.

[23]  Christoph Hirche,et al.  Polar Codes in Network Quantum Information Theory , 2016, IEEE Transactions on Information Theory.

[24]  A. Pellionisz,et al.  Brain modeling by tensor network theory and computer simulation. The cerebellum: Distributed processor for predictive coordination , 1979, Neuroscience.

[25]  G. Vidal,et al.  Classical simulation of quantum many-body systems with a tree tensor network , 2005, quant-ph/0511070.

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

[27]  A. Pellionisz,et al.  Tensor network theory of the metaorganization of functional geometries in the central nervous system , 1985, Neuroscience.

[28]  S. Stenholm.  Information, Physics and Computation, by Marc Mézard and Andrea Montanari , 2010 .

[29]  Robert J. McEliece,et al.  The generalized distributive law , 2000, IEEE Trans. Inf. Theory.

[30]  Andrew J. Ferris,et al.  Tensor Networks and Quantum Error Correction , 2013, Physical review letters.

[31]  G. Evenbly,et al.  Class of highly entangled many-body states that can be efficiently simulated. , 2012, Physical review letters.

[32]  Rolf Johannesson,et al.  Fundamentals of Convolutional Coding , 1999 .

[33]  Aaron D. Wyner,et al.  A theorem on the entropy of certain binary sequences and applications-II , 1973, IEEE Trans. Inf. Theory.

[34]  H. Pishro-Nik,et al.  On bit error rate performance of polar codes in finite regime , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[35]  William T. Freeman,et al.  Understanding belief propagation and its generalizations , 2003 .

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

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

[38]  G. Vidal.  Efficient classical simulation of slightly entangled quantum computations. , 2003, Physical review letters.

[39]  G. Vidal.  Entanglement renormalization. , 2005, Physical review letters.

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

[41]  Rüdiger L. Urbanke,et al.  Polar Codes: Characterization of Exponent, Bounds, and Constructions , 2010, IEEE Transactions on Information Theory.

[42]  Andrew J. Ferris,et al.  Branching MERA codes: A natural extension of classical and quantum polar codes , 2014, 2014 IEEE International Symposium on Information Theory.

[43]  Christoph Hirche,et al.  An improved rate region for the classical-quantum broadcast channel , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).