Fast Polarization and Finite-Length Scaling for Non-Stationary Channels

We consider the problem of polar coding for transmission over a non-stationary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{\infty}$, where the $i$-th encoded bit is transmitted over $W_i$. We show, for the first time, a polar coding scheme that achieves the effective average symmetric capacity $$ \overline{I}(\left\{W_i\right\}_{i=1}^{\infty}) \ := \lim_{N\rightarrow \infty} \frac{1}{N}\sum_{i=1}^N I(W_i), $$ assuming that the limit exists. The polar coding scheme is constructed using Ar{\i}kan's channel polarization transformation in combination with certain permutations at each polarization level and certain skipped operations. This guarantees a fast polarization process that results in polar coding schemes with block lengths upper bounded by a polynomial of $1/\epsilon$, where $\epsilon$ is the gap to the average capacity. More specifically, given an arbitrary sequence of BMS channels $\left\{W_i\right\}_{i=1}^{N}$ and $P_e$, where $0 < P_e <1$, we construct a polar code of length $N$ and rate $R$ guaranteeing a block error probability of at most $P_e$ for transmission over $\left\{W_i\right\}_{i=1}^{N}$ such that $$ N \leq \frac{\kappa}{(\overline{I}_N - R)^{\mu}} $$ where $\mu$ is a constant, $\kappa$ is a constant depending on $P_e$ and $\mu$, and $\overline{I}_N$ is the average of the symmetric capacities $I(W_i)$, for $i=1,2,,\dots,N$. We further show a numerical upper bound on $\mu$ that is: $\mu \leq 10.78$. The encoding and decoding complexities of the constructed polar code preserves $O(N \log N)$ complexity of Ar{\i}kan's polar codes.

[1]  Rüdiger L. Urbanke,et al.  Achieving Marton’s Region for Broadcast Channels Using Polar Codes , 2014, IEEE Transactions on Information Theory.

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

[3]  Eren Sasoglu,et al.  Polar codes for the two-user binary-input multiple-access channel , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

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

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

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

[7]  David Burshtein,et al.  Improved Bounds on the Finite Length Scaling of Polar Codes , 2013, IEEE Transactions on Information Theory.

[8]  Rüdiger L. Urbanke,et al.  Finite-Length Scaling for Polar Codes , 2013, IEEE Transactions on Information Theory.

[9]  Jungwon Lee,et al.  Achieving the Uniform Rate Region of General Multiple Access Channels by Polar Coding , 2013, IEEE Transactions on Communications.

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

[11]  Arman Fazeli,et al.  On the scaling exponent of binary polarization kernels , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[13]  Emmanuel Abbe,et al.  Randomness and dependencies extraction via polarization , 2011, 2011 Information Theory and Applications Workshop.

[14]  Rüdiger L. Urbanke,et al.  Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).