Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors

M. Mondelli, S.H. Hassani, R.L. Urbanke, IEEE Transactions on Information Theory 62 (2016) 6698–6712.


Journal Article | Published | English
Author
; ;
Abstract
Consider the transmission of a polar code of block length N and rate R over a binary memoryless symmetric channel W and let P e be the block error probability under successive cancellation decoding. In this paper, we develop new bounds that characterize the relationship of the parameters R, N, P e , and the quality of the channel W quantified by its capacity I(W) and its Bhattacharyya parameter Z(W). In previous work, two main regimes were studied. In the error exponent regime, the channel W and the rate R <; I(W) are fixed, and it was proved that the error probability Pe scales roughly as 2 -√N . In the scaling exponent approach, the channel W and the error probability Pe are fixed and it was proved that the gap to capacity I(W) - R scales as N -1/μ . Here, μ is called scaling exponent and this scaling exponent depends on the channel W. A heuristic computation for the binary erasure channel (BEC) gives μ = 3.627 and it was shown that, for any channel W, 3.579 ≤ μ ≤ 5.702. Our contributions are as follows. First, we provide the tighter upper bound μ <;≤ 4.714 valid for any W. With the same technique, we obtain the upper bound μ ≤ 3.639 for the case of the BEC; this upper bound approaches very closely the heuristically derived value for the scaling exponent of the erasure channel. Second, we develop a trade-off between the gap to capacity I(W)- R and the error probability Pe as the functions of the block length N. In other words, we neither fix the gap to capacity (error exponent regime) nor the error probability (scaling exponent regime), but we do consider a moderate deviations regime in which we study how fast both quantities, as the functions of the block length N, simultaneously go to 0. Third, we prove that polar codes are not affected by error floors. To do so, we fix a polar code of block length N and rate R. Then, we vary the channel W and study the impact of this variation on the error probability. We show that the error probability Pe scales as the Bhattacharyya parameter Z(W) raised to a power that scales roughly like VN. This agrees with the scaling in the error exponent regime.
Publishing Year
Date Published
2016-12-01
Journal Title
IEEE Transactions on Information Theory
Volume
62
Issue
12
Page
6698-6712
ISSN
eISSN
IST-REx-ID

Cite this

Mondelli M, Hassani SH, Urbanke RL. Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. IEEE Transactions on Information Theory. 2016;62(12):6698-6712. doi:10.1109/tit.2016.2616117
Mondelli, M., Hassani, S. H., & Urbanke, R. L. (2016). Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. IEEE Transactions on Information Theory, 62(12), 6698–6712. https://doi.org/10.1109/tit.2016.2616117
Mondelli, Marco, S. Hamed Hassani, and Rudiger L. Urbanke. “Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.” IEEE Transactions on Information Theory 62, no. 12 (2016): 6698–6712. https://doi.org/10.1109/tit.2016.2616117.
M. Mondelli, S. H. Hassani, and R. L. Urbanke, “Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors,” IEEE Transactions on Information Theory, vol. 62, no. 12, pp. 6698–6712, 2016.
Mondelli M, Hassani SH, Urbanke RL. 2016. Unified scaling of polar codes: Error exponent, scaling exponent, moderate deviations, and error floors. IEEE Transactions on Information Theory. 62(12), 6698–6712.
Mondelli, Marco, et al. “Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.” IEEE Transactions on Information Theory, vol. 62, no. 12, IEEE, 2016, pp. 6698–712, doi:10.1109/tit.2016.2616117.

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1501.02444

Search this title in

Google Scholar