Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

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 channel W. In particular, we study the asymptotics of the cumulative distribution, P(Z(n) <= z), where {Z(n)} is the Bhattacharyya process associated with W, 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 Arikan and Telatar. Our results apply to general polar codes based on l x l 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 l = 2, but there is a gap for l > 2.


Published in:
Ieee Transactions On Information Theory, 59, 4, 2267-2276
Year:
2013
Publisher:
Piscataway, Ieee-Inst Electrical Electronics Engineers Inc
ISSN:
0018-9448
Laboratories:




 Record created 2013-05-13, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)