{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:40:43Z","timestamp":1760190043854,"version":"build-2065373602"},"reference-count":24,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T00:00:00Z","timestamp":1568678400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51874264, 61571108, 61379027"],"award-info":[{"award-number":["51874264, 61571108, 61379027"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Although the adaptive successive cancellation list (AD-SCL) algorithm and the segmented-CRC adaptive successive cancellation list (SCAD-SCL) algorithm based on the cyclic redundancy check (CRC) can greatly reduce the computational complexity of the successive cancellation list (SCL) algorithm, these two algorithms discard the previous decoding result and re-decode by increasing L, where L is the size of list. When CRC fails, these two algorithms waste useful information from the previous decoding. In this paper, a simplified adaptive successive cancellation list (SAD-SCL) is proposed. Before the re-decoding of updating value L each time, SAD-SCL uses the existing log likelihood ratio (LLR) information to locate the range of burst error bits, and then re-decoding starts at the incorrect bit with the smallest index in this range. Moreover, when the segmented information sequence cannot get the correct result of decoding, the SAD-SCL algorithm uses SC decoding to complete the decoding of the subsequent segmentation information sequence. Furthermore, its decoding performance is almost the same as that of the subsequent segmentation information sequence using the AD-SCL algorithm. The simulation results show that the SAD-SCL algorithm has lower computational complexity than AD-SCL and SCAD-SCL with negligible loss of performance.<\/jats:p>","DOI":"10.3390\/e21090899","type":"journal-article","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T04:50:21Z","timestamp":1569214221000},"page":"899","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Adaptive Successive Cancellation List Decoding of Polar Codes"],"prefix":"10.3390","volume":"21","author":[{"given":"Xiumin","family":"Wang","sequence":"first","affiliation":[{"name":"College of Information Engineering, China Jiliang University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinlong","family":"He","sequence":"additional","affiliation":[{"name":"College of Information Engineering, China Jiliang University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"Binjiang College, Nanjing University of Information Science &amp; Technology, Wuxi 214105, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhuoting","family":"Wu","sequence":"additional","affiliation":[{"name":"College of Information Engineering, China Jiliang University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liang","family":"Shan","sequence":"additional","affiliation":[{"name":"College of Information Engineering, China Jiliang University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo","family":"Hong","sequence":"additional","affiliation":[{"name":"College of Information Engineering, China Jiliang University, Hangzhou 310018, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,9,17]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Arikan, E. (2008, January 6\u201311). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. Proceedings of the 2008 IEEE International Symposium on Information Theory, Toronto, ON, Canada.","DOI":"10.1109\/ISIT.2008.4595172"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"18172","DOI":"10.1109\/ACCESS.2019.2897114","article-title":"Scenario-Simplified Successive Cancellation Decoding of Polar Codes for Channel with Deletions","volume":"7","author":"Tian","year":"2019","journal-title":"IEEE ACCESS"},{"key":"ref_3","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_4","doi-asserted-by":"crossref","first-page":"1668","DOI":"10.1109\/LCOMM.2012.090312.121501","article-title":"CRC-aided decoding of polar codes","volume":"16","author":"Niu","year":"2012","journal-title":"IEEE Commun. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"9575","DOI":"10.1109\/ACCESS.2019.2890838","article-title":"Successive Cancellation Priority Decoding of Polar Codes","volume":"7","author":"Guan","year":"2019","journal-title":"IEEE Access"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Kim, J.-H., Kim, S.-H., Jang, J.-W., and Kim, Y.-S. (2017). Low complexity list decoding for polar codes with multiple CRC codes. Entropy, 19.","DOI":"10.3390\/e19040183"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"58346","DOI":"10.1109\/ACCESS.2019.2914691","article-title":"Bit-Flip Algorithm for Successive Cancellation List Decoder of Polar Codes","volume":"7","author":"Cheng","year":"2019","journal-title":"IEEE Access"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/JSAC.2015.2504299","article-title":"Fast list decoders for polar codes","volume":"34","author":"Sarkis","year":"2015","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Hashemi, S.A., Condo, C., and Gross, W.J. (2017, January 19\u201322). Fast Simplified Successive-Cancellation List Decoding of Polar Codes. Presented at the 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW), San Francisco, CA, USA.","DOI":"10.1109\/WCNCW.2017.7919044"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Zhou, H., Zhang, C., Song, W., Xu, S., and You, X. (2016, January 15\u201318). Segmented CRC-aided SC list polar decoding. Proceedings of the 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring), Nanjing, China.","DOI":"10.1109\/VTCSpring.2016.7504469"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4971","DOI":"10.1109\/TSP.2018.2864580","article-title":"A fast successive cancellation list decoder for polar codes with an early stopping criterion","volume":"66","author":"Kim","year":"2018","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/LCOMM.2019.2894150","article-title":"Path Splitting Selecting Strategy-Aided Successive Cancellation List Algorithm for Polar Codes","volume":"23","author":"Gao","year":"2019","journal-title":"IEEE Commun. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"022309","DOI":"10.1007\/s11432-017-9128-x","article-title":"A complexity-reduced fast successive cancellation list decoder for polar codes","volume":"61","author":"Xu","year":"2018","journal-title":"Sci. China Inf. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Jin, H., and Liu, R. (2018, January 16\u201318). List Estimation-aided Successive-Cancellation List Decoding of Polar Codes. Proceedings of the 2018 IEEE\/CIC International Conference on Communications in China (ICCC), Beijing, China.","DOI":"10.1109\/ICCChina.2018.8641216"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1109\/LCOMM.2017.2676775","article-title":"Enhanced successive cancellation list decoding of polar codes","volume":"21","author":"Shi","year":"2017","journal-title":"IEEE Commun. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Yang, J., Zhang, C., Xu, S., and You, X. (2015, January 15\u201317). Low-complexity adaptive successive cancellation list polar decoder based on relaxed sorting. Proceedings of the 2015 International Conference on Wireless Communications & Signal Processing (WCSP), Nanjing, China.","DOI":"10.1109\/WCSP.2015.7341298"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Zhang, C., Wang, Z., You, X., and Yuan, B. (2014, January 2\u20135). Efficient adaptive list successive cancellation decoder for polar codes. Proceedings of the 2014 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2014.7094411"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Hashemi, S.A., Balatsoukas-Stimming, A., Giard, P., Thibeault, C., and Gross, W.J. (2016, January 20\u201325). Partitioned successive-cancellation list decoding of polar codes. Proceedings of the 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Shanghai, China.","DOI":"10.1109\/ICASSP.2016.7471817"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"3749","DOI":"10.1109\/TCOMM.2018.2832207","article-title":"Decoder partitioning: Towards practical list decoding of polar codes","volume":"66","author":"Hashemi","year":"2018","journal-title":"IEEE Trans. Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2044","DOI":"10.1109\/LCOMM.2012.111612.121898","article-title":"An adaptive successive cancellation list decoder for polar codes with cyclic redundancy check","volume":"16","author":"Li","year":"2012","journal-title":"IEEE Commun. Lett."},{"key":"ref_21","unstructured":"Wang, Q., Luo, Y., and Li, S. (2019). Polar Adaptive Successive Cancellation List Decoding Based on Segmentation Cyclic Redundancy Check. J. Electron. Inf. Technol., 1\u20137."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Afisiadis, O., Balatsoukas-Stimming, A., and Burg, A. (2014, January 2\u20135). A low-complexity improved successive cancellation decoder for polar codes. Proceedings of the 2014 48th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, USA.","DOI":"10.1109\/ACSSC.2014.7094848"},{"key":"ref_23","first-page":"63","article-title":"Successive cancellation multibit-flipping decoding algorithm for polar codes","volume":"44","author":"Li","year":"2017","journal-title":"J. Xidian Univ."},{"key":"ref_24","unstructured":"Wang, T., Qu, D., and Jiang, T. (2018). Cluster Pairwise Error Probability and Construction of Parity-Check-Concatenated Polar Codes. arXiv."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/9\/899\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:20:56Z","timestamp":1760188856000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/21\/9\/899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,17]]},"references-count":24,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2019,9]]}},"alternative-id":["e21090899"],"URL":"https:\/\/doi.org\/10.3390\/e21090899","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2019,9,17]]}}}