{"date_updated":"2023-08-07T13:36:24Z","month":"06","volume":"2020-June","date_created":"2020-09-20T22:01:37Z","department":[{"_id":"MaMo"}],"title":"Simplified successive cancellation decoding of polar codes has sublinear latency","_id":"8536","author":[{"orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco"},{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"full_name":"Cioffi, John","last_name":"Cioffi","first_name":"John"},{"last_name":"Goldsmith","full_name":"Goldsmith, Andrea","first_name":"Andrea"}],"article_number":"401-406","type":"conference","year":"2020","publication_status":"published","oa_version":"Preprint","oa":1,"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.","publication":"IEEE International Symposium on Information Theory - Proceedings","external_id":{"arxiv":["1909.04892"]},"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1909.04892","open_access":"1"}],"date_published":"2020-06-01T00:00:00Z","publication_identifier":{"issn":["21578095"],"isbn":["9781728164328"]},"day":"01","status":"public","conference":{"start_date":"2020-06-21","end_date":"2020-06-26","name":"ISIT: Internation Symposium on Information Theory","location":"Los Angeles, CA, United States"},"citation":{"apa":"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>","short":"M. Mondelli, S.A. Hashemi, J. Cioffi, A. Goldsmith, in:, IEEE International Symposium on Information Theory - Proceedings, IEEE, 2020.","ista":"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, 401–406.","mla":"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>.","chicago":"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>.","ieee":"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.","ama":"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>"},"doi":"10.1109/ISIT44484.2020.9174141","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"9047","relation":"later_version"}]},"article_processing_charge":"No","language":[{"iso":"eng"}],"publisher":"IEEE","abstract":[{"text":"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.","lang":"eng"}]}