Fast Polarization for Processes with Memory

Fast polarization is crucial for the performance guarantees of polar codes. In the memoryless setting, the rate of polarization is known to be exponential in the square root of the block length. A complete characterization of the rate of polarization for models with memory has been missing. We consider polar codes for processes with memory that are characterized by an underlying aperiodic and irreducible finite state Markov chain. We show that the rate of polarization for these processes is the same as in the memoryless setting, both to the high and to the low-entropy sets. Thus, polar codes achieve the Markov capacity in many information-theoretic applications.

[1]  Amir Beck,et al.  Introduction to Nonlinear Optimization - Theory, Algorithms, and Applications with MATLAB , 2014, MOS-SIAM Series on Optimization.

[2]  Mine Alsan.  Re-proving Channel Polarization Theorems , 2015 .

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

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

[5]  J. Norris.  Appendix: probability and measure , 1997 .

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

[7]  Paul H. Siegel,et al.  Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels , 2004, IEEE Transactions on Information Theory.

[8]  Ido Tal,et al.  Fast Polarization for Processes With Memory , 2017, IEEE Transactions on Information Theory.

[9]  Rongke Liu,et al.  Joint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels , 2014, ArXiv.

[10]  B. Marcus.  Constrained Systems and Coding for Recording Channels, in Handbook of Coding Theory, v. Finite-state Modulation Codes for Data Storage, Ieee , 2000 .

[11]  John Fan.  Constrained Coding and Error- Control Coding , 2004 .

[12]  Rongke Liu,et al.  Construction of polar codes for channels with memory , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[13]  Junya Honda,et al.  Polar Coding Without Alphabet Extension for Asymmetric Models , 2013, IEEE Transactions on Information Theory.

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

[15]  Ido Tal.  A Simple Proof of Fast Polarization , 2017, IEEE Transactions on Information Theory.

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

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

[18]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[19]  Israel Bar-David,et al.  Capacity and coding for the Gilbert-Elliot channels , 1989, IEEE Trans. Inf. Theory.

[20]  Rüdiger L. Urbanke,et al.  Polar Codes are Optimal for Lossy Source Coding , 2009, IEEE Transactions on Information Theory.

[21]  Shlomo Shamai,et al.  Secrecy-achieving polar-coding , 2010, 2010 IEEE Information Theory Workshop.

[22]  Michael Lentmaier,et al.  Challenges and some new directions in channel coding , 2015, Journal of Communications and Networks.

[23]  Paul H. Siegel,et al.  On the achievable information rates of finite state ISI channels , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[24]  Richard C. Bradley,et al.  Introduction to strong mixing conditions , 2007 .

[25]  Eren Sasoglu.  Polar Coding Theorems for Discrete Systems , 2011 .

[26]  Ido Tal,et al.  Polar coding for processes with memory , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[28]  Ilya Dumer.  Polar codes with a stepped boundary , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).