We consider the asymptotic behavior of the polarization process for polar codes when the blocklength tends to infinity. In particular, we study the asymptotics of the cumulative distribution ℙ(Z<inf>n</inf> ≤ z), where Z<inf>n</inf> = Z(W<inf>n</inf>) is the Bhat-tacharyya process, and its dependence on the rate of transmission R. We show that for a BMS channel W, for R < I(W) we have lim<inf>n→8</inf> ℙ equations R and for R < 1 − I(W) we have <inf>n→8</inf> ℙ equations R, where Q(x) is the probability that a standard normal random variable exceeds x. As a result, if we denote by ℙ<sup>SC</sup><inf>e</inf> (n,R) the probability of error using polar codes of block-length N = 2<sup>n</sup> and rate R < I(W) under successive cancellation decoding, then log(−log(ℙ<sup>SC</sup><inf>e</inf> (n,R))) scales as equations. We also prove that the same result holds for the block error probability using the MAP decoder, i.e., for log(−log(ℙ<sup>MAP</sup><inf>e</inf> (n,R))).
[1]
Emre Telatar,et al.
On the rate of channel polarization
,
2008,
2009 IEEE International Symposium on Information Theory.
[2]
Rüdiger L. Urbanke,et al.
On the scaling of polar codes: II. The behavior of un-polarized channels
,
2010,
2010 IEEE International Symposium on Information Theory.
[3]
Rüdiger L. Urbanke,et al.
Modern Coding Theory
,
2008
.
[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]
Rüdiger L. Urbanke,et al.
Polar Codes for Channel and Source Coding
,
2009,
ArXiv.