We consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over a binary-input memoryless symmetric channelW. In particular, we study the asymptotics of the cumulative distribution(Zₙ≤ z), whereₙ the Bhattacharyya process associated withW, and its dependence on the rate of transmission. On the basis of this result, we characterize the asymptotic behavior, as well as its dependence on the rate, of the block error probability of polar codes using the successive cancellation decoder. This refines the original asymptotic bounds by Arıkan and Telatar. Our results apply to general polar codes based on×kernel matrices. We also provide asymptotic lower bounds on the block error probability of polar codes using the maximum a posteriori (MAP) decoder. The MAP lower bound and the successive cancellation upper bound coincide when=2, but there is a gap for> 2.
No takes yet. Share an insight, caveat, or question.
Hassani et al. (2012) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: