Simplified successive cancellation decoding of polar codes has sublinear latency

M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020.


Conference Paper | Published | English

Scopus indexed
Author
Mondelli, MarcoIST Austria ; Hashemi, Seyyed Ali; Cioffi, John; Goldsmith, Andrea
Department
Abstract
This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N 1−1/µ ), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.
Publishing Year
Date Published
2020-06-01
Proceedings Title
IEEE International Symposium on Information Theory - Proceedings
Acknowledgement
M. Mondelli was partially supported by grants NSF DMS-1613091, CCF-1714305, IIS-1741162 and ONR N00014-18-1-2729. S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei.
Volume
2020-June
Article Number
401-406
Conference
ISIT: Internation Symposium on Information Theory
Conference Location
Los Angeles, CA, United States
Conference Date
2020-06-21 – 2020-06-26
ISSN
IST-REx-ID

Cite this

Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: IEEE International Symposium on Information Theory - Proceedings. Vol 2020-June. IEEE; 2020. doi:10.1109/ISIT44484.2020.9174141
Mondelli, M., Hashemi, S. A., Cioffi, J., & Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2020–June). Los Angeles, CA, United States: IEEE. https://doi.org/10.1109/ISIT44484.2020.9174141
Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In IEEE International Symposium on Information Theory - Proceedings, Vol. 2020–June. IEEE, 2020. https://doi.org/10.1109/ISIT44484.2020.9174141.
M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in IEEE International Symposium on Information Theory - Proceedings, Los Angeles, CA, United States, 2020, vol. 2020–June.
Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. 2020. Simplified successive cancellation decoding of polar codes has sublinear latency. IEEE International Symposium on Information Theory - Proceedings. ISIT: Internation Symposium on Information Theory vol. 2020–June.
Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” IEEE International Symposium on Information Theory - Proceedings, vol. 2020–June, 401–406, IEEE, 2020, doi:10.1109/ISIT44484.2020.9174141.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]

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

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1909.04892

Search this title in

Google Scholar
ISBN Search