Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization

Abstract

For a binary-input memoryless symmetric channel $W$, we consider the asymptotic behavior of the polarization process in the large block-length regime when transmission takes place over $W$. In particular, we study the asymptotics of the cumulative distribution $\mathbb{P}(Z_n\le z)$, where $\{Z_n\}$ is the Bhattacharyya process defined from $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 bounds by Arıkan and Telatar. Our results apply to general polar codes based on $\ell \times \ell$ kernel matrices. We also provide lower bounds on the block error probability of polar codes using the MAP decoder. The MAP lower bound and the successive cancellation upper bound coincide when $\ell =2$, but there is a gap for $\ell >2$.

Submitted to IEEE Transactions on Information Theory

References in corpus (5)

• Polarization for arbitrary discrete memoryless channels
• Performance and Construction of Polar Codes on Symmetric Binary-Input Memoryless Channels
• On the scaling of Polar codes: I. The behavior of polarized channels
• Properties and Construction of Polar Codes
• Polar Codes for the m-User MAC

Cited by in corpus (19)

• Polar Subcodes
• Finite-Length Scaling of Polar Codes
• A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
• Polar Codes' Simplicity, Random Codes' Durability
• Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices
• Channel Polarization through the Lens of Blackwell Measures
• New Understanding of the Bethe Approximation and the Replica Method
• Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability
• Universal Bounds on the Scaling Behavior of Polar Codes
• Polar Code Moderate Deviation: Recovering the Scaling Exponent
• Improved Bounds on the Finite Length Scaling of Polar Codes
• Scaling Exponent of List Decoders with Applications to Polar Codes
• Complexity and Second Moment of the Mathematical Theory of Communication
• Erasure Schemes Using Generalized Polar Codes: Zero-Undetected-Error Capacity and Performance Trade-offs
• Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes
• Low Complexity List Successive Cancellation Decoding of Polar Codes
• Challenges and some new directions in channel coding
• Polar Coding for the Binary Erasure Channel with Deletions
• A Correlation-Breaking Interleaving of Polar Codes in Concatenated Systems