{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T16:28:00Z","timestamp":1779294480674,"version":"3.51.4"},"reference-count":28,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T00:00:00Z","timestamp":1492992000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Polar codes are the first family of error correcting codes that provably achieve the capacity of symmetric binary-input discrete memoryless channels with low complexity. Since the development of polar codes, there have been many studies to improve their finite-length performance. As a result, polar codes are now adopted as a channel code for the control channel of 5G new radio of the 3rd generation partnership project. However, the decoder implementation is one of the big practical problems and low complexity decoding has been studied. This paper addresses a low complexity successive cancellation list decoding for polar codes utilizing multiple cyclic redundancy check (CRC) codes. While some research uses multiple CRC codes to reduce memory and time complexity, we consider the operational complexity of decoding, and reduce it by optimizing CRC positions in combination with a modified decoding operation. Resultingly, the proposed scheme obtains not only complexity reduction from early stopping of decoding, but also additional reduction from the reduced number of decoding paths.<\/jats:p>","DOI":"10.3390\/e19040183","type":"journal-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T13:10:11Z","timestamp":1493039411000},"page":"183","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Low Complexity List Decoding for Polar Codes with Multiple CRC Codes"],"prefix":"10.3390","volume":"19","author":[{"given":"Jong-Hwan","family":"Kim","sequence":"first","affiliation":[{"name":"College of Information and Communication Engineering, Sungkyunkwan University, Gyeonggi-do, Suwon 16419, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sang-Hyo","family":"Kim","sequence":"additional","affiliation":[{"name":"College of Information and Communication Engineering, Sungkyunkwan University, Gyeonggi-do, Suwon 16419, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji-Woong","family":"Jang","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Ulsan College, Hwajeong-dong, Dong-gu, Ulsan 44022, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4114-4935","authenticated-orcid":false,"given":"Young-Sik","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Engineering, Chosun University, Gwangju 61452, Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2017,4,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"3051","DOI":"10.1109\/TIT.2009.2021379","article-title":"Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels","volume":"55","author":"Arikan","year":"2009","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Arikan, E. (2010, January 13\u201318). Source polarization. Proccedings of the IEEE International Symposium on Information Theory, Austin, TX, USA.","DOI":"10.1109\/ISIT.2010.5513567"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Cronie, H.S., and Korada, S.B. (2010, January 13\u201318). Lossless source coding with polar codes. Proccedings of the IEEE International Symposium on Information Theory, Austin, TX, USA.","DOI":"10.1109\/ISIT.2010.5513561"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1751","DOI":"10.1109\/TIT.2010.2040961","article-title":"Polar codes are optimal for lossy source coding","volume":"56","author":"Korada","year":"2010","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"5437","DOI":"10.1109\/TIT.2012.2201374","article-title":"Polar codes for the m-user multiple access channel","volume":"58","author":"Abbe","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1109\/TCOMM.2015.2507587","article-title":"Achieving the uniform rate region of general multiple access channels by polar coding","volume":"64","author":"Mahdavifar","year":"2016","journal-title":"IEEE Trans. Commun."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1109\/TIT.2014.2378172","article-title":"Polar codes for broadcast channels","volume":"61","author":"Goela","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1109\/TIT.2014.2368555","article-title":"Achieving Marton\u2019s region for broadcast channels using polar codes","volume":"61","author":"Mondelli","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_9","unstructured":"Hussami, N., Urbanke, R.L., and Korada, S.B. (July, January 28). Performance of polar codes for channel and source coding. Proccedings of the IEEE International Symposium on Information Theory, Seoul, Korea."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Korada, S.B., and Urbanke, R. (2010, January 6\u20138). Polar codes for Slepian\u2013Wolf, Wyner\u2013Ziv, and Gelfand\u2013Pinsker. Proccedings of the IEEE Information Theory Workshop on Information Theory, Cairo, Egypt.","DOI":"10.1109\/ITWKSPS.2010.5503220"},{"key":"ref_11","unstructured":"Arikan, E. (2012, January 1\u20136). Polar coding for the Slepian\u2013Wolf problem based on monotone chain rules. Proccedings of the IEEE International Symposium on Information Theory, Cambridge, MA, USA."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"2213","DOI":"10.1109\/TIT.2015.2410251","article-title":"List decoding of polar codes","volume":"61","author":"Tal","year":"2015","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_13","unstructured":"Tal, I., and Vardy, A. (August, January 31). List decoding of polar codes. Proccedings of the IEEE International Symposium on Information Theory, St. Petersburg, Russia."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"2343","DOI":"10.1109\/LCOMM.2016.2607169","article-title":"Parity-check- concatenated polar codes","volume":"20","author":"Wang","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2081","DOI":"10.1109\/LCOMM.2014.2364845","article-title":"A novel puncturing scheme for polar codes","volume":"18","author":"Wang","year":"2014","journal-title":"IEEE Commun. Lett."},{"key":"ref_16","unstructured":"MCC Support (2016, January 14\u201318). Final Report of 3GPP TSG RAN WG1 #87 v1.0.0 (R1-1701552). Proceedings of the 3GPP TSG RAN WG1 Meeting #87, Reno, NV, USA."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"2268","DOI":"10.1109\/TVLSI.2014.2359793","article-title":"Low-latency successive-cancellation list decoders for polar codes with multibit decision","volume":"23","author":"Yuan","year":"2015","journal-title":"IEEE Trans. Very Large Scale Integr. Syst."},{"key":"ref_18","unstructured":"Hung, S.-Y., Yen, S.-W., Chen, C.-L., Chang, H.-C., Jou, S.-J., and Lee, C.-Y. (2010, January 8\u201310). A 5.7 Gbps row-based layered scheduling LDPC decoder for IEEE 802.15.3c applications. Proceedings of the IEEE Asian Solid-State Circuits Conference, Beijing, China."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/JSAC.2015.2504321","article-title":"A split-reduced successive cancellation list decoder for polar codes","volume":"34","author":"Zhang","year":"2016","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/LCOMM.2015.2506568","article-title":"Reduce the complexity of list decoding of polar codes by tree-pruning","volume":"20","author":"Chen","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1109\/LCOMM.2015.2508022","article-title":"Multi-CRC polar codes and their applications","volume":"20","author":"Guo","year":"2016","journal-title":"IEEE Commun. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhou, H., Zhan, C., Song, W., Xu, S., and You, X. (2016, January 15\u201318). Segmented CRC-aided SC list polar decoding. Proccedings of the IEEE Vehicular Technology Conference (VTC Spring), Nanjing, China.","DOI":"10.1109\/VTCSpring.2016.7504469"},{"key":"ref_23","unstructured":"Chiu, M.-C., and Wu, W.-D. (arXiv, 2016). Reduced-complexity SCL decoding of multi-CRC-aided polar codes, arXiv."},{"key":"ref_24","unstructured":"Huawei, and HiSilicon (2016, January 23\u201327). On latency and complexity (R1-164040). Proceedings of the 3GPP TSG RAN WG1 Meeting #85, Nanjing, China."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"5165","DOI":"10.1109\/TSP.2015.2439211","article-title":"LLR-based successive cancellation list decoding of polar codes","volume":"63","author":"Burg","year":"2015","journal-title":"IEEE Trans. Signal. Process."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/26.768759","article-title":"Reduced complexity iterative decoding of low-density parity-check codes based on belief propagation","volume":"47","author":"Fossorier","year":"1999","journal-title":"IEEE Trans. Commun."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Leroux, C., Tal, I., Vard, A., and Gross, W. (2011, January 22\u201327). Hardware architectures for successive cancellation decoding of polar codes. Proccedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, Prague, Czech.","DOI":"10.1109\/ICASSP.2011.5946819"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1109\/LCOMM.2009.090428","article-title":"Performance of polar codes with the construction using density evolution","volume":"13","author":"Mori","year":"2009","journal-title":"IEEE Commun. Lett."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/4\/183\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:33:16Z","timestamp":1760207596000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/19\/4\/183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,24]]},"references-count":28,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2017,4]]}},"alternative-id":["e19040183"],"URL":"https:\/\/doi.org\/10.3390\/e19040183","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,24]]}}}