conference paper published yes Marco Mondelli author 27EB676C-8706-11E9-9510-7717E66974250000-0002-3242-7020 Seyyed Ali Hashemi author John Cioffi author Andrea Goldsmith author MaMo department ISIT: International Symposium on Information Theory 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. IEEE2020Los Angeles, CA, United States eng 2157-8095 9781728164328 1909.04892 00071496340006910.1109/ISIT44484.2020.9174141 2020-June https://research-explorer.ista.ac.at/record/9047 M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020. Mondelli, M., Hashemi, S. A., Cioffi, J., &#38; Goldsmith, A. (2020). Simplified successive cancellation decoding of polar codes has sublinear latency. In <i>IEEE International Symposium on Information Theory - Proceedings</i> (Vol. 2020–June). Los Angeles, CA, United States: IEEE. <a href="https://doi.org/10.1109/ISIT44484.2020.9174141">https://doi.org/10.1109/ISIT44484.2020.9174141</a> Mondelli M, Hashemi SA, Cioffi J, Goldsmith A. Simplified successive cancellation decoding of polar codes has sublinear latency. In: <i>IEEE International Symposium on Information Theory - Proceedings</i>. Vol 2020-June. IEEE; 2020. doi:<a href="https://doi.org/10.1109/ISIT44484.2020.9174141">10.1109/ISIT44484.2020.9174141</a> M. Mondelli, S. A. Hashemi, J. Cioffi, and A. Goldsmith, “Simplified successive cancellation decoding of polar codes has sublinear latency,” in <i>IEEE International Symposium on Information Theory - Proceedings</i>, Los Angeles, CA, United States, 2020, vol. 2020–June. Mondelli, Marco, Seyyed Ali Hashemi, John Cioffi, and Andrea Goldsmith. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” In <i>IEEE International Symposium on Information Theory - Proceedings</i>, Vol. 2020–June. IEEE, 2020. <a href="https://doi.org/10.1109/ISIT44484.2020.9174141">https://doi.org/10.1109/ISIT44484.2020.9174141</a>. Mondelli, Marco, et al. “Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency.” <i>IEEE International Symposium on Information Theory - Proceedings</i>, vol. 2020–June, 401–406, IEEE, 2020, doi:<a href="https://doi.org/10.1109/ISIT44484.2020.9174141">10.1109/ISIT44484.2020.9174141</a>. 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: International Symposium on Information Theory vol. 2020–June, 401–406. 85362020-09-20T22:01:37Z2025-09-10T10:27:05Z