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. Namely, previous works have not addressed fast polarization of the high entropy set under memory. We consider polar codes for processes with memory that are characterized by an underlying ergodic finite-state Markov chain. We show that the rate of polarization for these processes is the same as in the memoryless setting, both for the high and for the low entropy sets.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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