{"article_processing_charge":"No","day":"01","author":[{"last_name":"Hashemi","first_name":"Seyyed Ali","full_name":"Hashemi, Seyyed Ali"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","full_name":"Mondelli, Marco"},{"first_name":"Arman","full_name":"Fazeli, Arman","last_name":"Fazeli"},{"full_name":"Vardy, Alexander","first_name":"Alexander","last_name":"Vardy"},{"first_name":"John","full_name":"Cioffi, John","last_name":"Cioffi"},{"first_name":"Andrea","full_name":"Goldsmith, Andrea","last_name":"Goldsmith"}],"doi":"10.1109/TWC.2021.3125626","_id":"10364","oa":1,"publication":"IEEE Transactions on Wireless Communications","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"scopus_import":"1","volume":21,"citation":{"chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>. Institute of Electrical and Electronics Engineers, 2022. <a href=\"https://doi.org/10.1109/TWC.2021.3125626\">https://doi.org/10.1109/TWC.2021.3125626</a>.","short":"S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, IEEE Transactions on Wireless Communications 21 (2022) 3909–3920.","apa":"Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith, A. (2022). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. <i>IEEE Transactions on Wireless Communications</i>. Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/TWC.2021.3125626\">https://doi.org/10.1109/TWC.2021.3125626</a>","ista":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2022. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. 21(6), 3909–3920.","ama":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. <i>IEEE Transactions on Wireless Communications</i>. 2022;21(6):3909-3920. doi:<a href=\"https://doi.org/10.1109/TWC.2021.3125626\">10.1109/TWC.2021.3125626</a>","mla":"Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>, vol. 21, no. 6, Institute of Electrical and Electronics Engineers, 2022, pp. 3909–20, doi:<a href=\"https://doi.org/10.1109/TWC.2021.3125626\">10.1109/TWC.2021.3125626</a>.","ieee":"S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” <i>IEEE Transactions on Wireless Communications</i>, vol. 21, no. 6. Institute of Electrical and Electronics Engineers, pp. 3909–3920, 2022."},"page":"3909-3920","department":[{"_id":"MaMo"}],"type":"journal_article","status":"public","publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers","intvolume":"        21","title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","abstract":[{"lang":"eng","text":"This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1-1/μ + N/P log2 log2 N/P), where N is the block length of the code and μ is the scaling exponent of the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P = N/2, the latency of SSC decoding is O(N1-1/μ), which is sublinear in the block length. This recovers a result from our earlier work. Second, in a fully-serial implementation where P = 1, the latency of SSC decoding scales as O(N log2 log2 N). The multiplicative constant is also calculated: we show that the latency of SSC decoding when P = 1 is given by (2 + o(1))N log2 log2 N. Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P = N1/μ. The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations."}],"quality_controlled":"1","isi":1,"date_updated":"2023-08-14T06:55:57Z","date_created":"2021-11-28T23:01:29Z","issue":"6","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","date_published":"2022-06-01T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"isi":["000809406400028"],"arxiv":["2012.13378"]},"year":"2022","main_file_link":[{"url":"https://arxiv.org/abs/2012.13378","open_access":"1"}],"acknowledgement":"S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli is partially\r\nsupported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by\r\nthe National Science Foundation under Grant CCF-1764104.","oa_version":"Preprint","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"10053"}]},"publication_identifier":{"issn":["1536-1276"],"eissn":["1558-2248"]},"article_type":"original","month":"06"}