{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T19:12:33Z","timestamp":1761419553938,"version":"build-2065373602"},"reference-count":18,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T00:00:00Z","timestamp":1674086400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Natural Science Foundation of China","award":["92067202","62071058","62001049"],"award-info":[{"award-number":["92067202","62071058","62001049"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>CRC-aided successive cancellation list (CA-SCL) decoding is a powerful algorithm that dramatically improves the error performance of polar codes. Path selection is a major issue that affects the decoding latency of SCL decoders. Generally, path selection is implemented using a metric sorter, which causes its latency to increase as the list grows. In this paper, intelligent path selection (IPS) is proposed as an alternative to the traditional metric sorter. First, we found that in the path selection, only the most reliable paths need to be selected, and it is not necessary to completely sort all paths. Second, based on a neural network model, an intelligent path selection scheme is proposed, including a fully connected network construction, a threshold and a post-processing unit. Simulation results show that the proposed path-selection method can achieve comparable performance gain to the existing methods under SCL\/CA-SCL decoding. Compared with the conventional methods, IPS has lower latency for medium and large list sizes. For the proposed hardware structure, IPS\u2019s time complexity is O(klog2(L)) where k is the number of hidden layers of the network and L is the list size.<\/jats:p>","DOI":"10.3390\/e25020200","type":"journal-article","created":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T08:22:36Z","timestamp":1674116556000},"page":"200","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Intelligent Path-Selection-Aided Decoding of Polar Codes"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6917-1201","authenticated-orcid":false,"given":"Hongji","family":"Cui","sequence":"first","affiliation":[{"name":"Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Niu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shunfu","family":"Zhong","sequence":"additional","affiliation":[{"name":"Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing 100876, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,19]]},"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","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_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":"5165","DOI":"10.1109\/TSP.2015.2439211","article-title":"LLR-based successive cancellation list decoding of polar codes","volume":"63","author":"Parizi","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Balatsoukas-Stimming, A., Parizi, M.B., and Burg, A. (2015, January 24\u201327). On metric sorting for successive cancellation list decoding of polar codes. Proceedings of the 2015 IEEE International Symposium on Circuits and Systems (ISCAS), Lisbon, Portugal.","DOI":"10.1109\/ISCAS.2015.7169066"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1109\/JSAC.2015.2504318","article-title":"A low-latency list successive-cancellation decoding implementation for polar codes","volume":"34","author":"Fan","year":"2015","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"ref_7","first-page":"673","article-title":"Efficient sorting architecture for successive-cancellation-list decoding of polar codes","volume":"63","author":"Kong","year":"2016","journal-title":"IEEE Trans. Circuits Syst. II Express Briefs"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1109\/LCOMM.2018.2803163","article-title":"Enhanced metric sorting for successive cancellation list decoding of polar codes","volume":"22","author":"Li","year":"2018","journal-title":"IEEE Commun. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/LCOMM.2019.2931300","article-title":"Hybrid Bucket Sorting Method for Successive Cancellation List Decoding of Polar Codes","volume":"23","author":"Wang","year":"2019","journal-title":"IEEE Commun. Lett."},{"key":"ref_10","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_11","doi-asserted-by":"crossref","first-page":"2428","DOI":"10.1109\/TVT.2021.3059370","article-title":"List Viterbi decoding of PAC codes","volume":"70","author":"Rowshan","year":"2021","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"174102","DOI":"10.1103\/PhysRevLett.88.174102","article-title":"Permutation entropy: A natural complexity measure for time series","volume":"88","author":"Bandt","year":"2002","journal-title":"Phys. Rev. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0925-2312(96)00040-9","article-title":"A low-cost neural sorting network with O (1) time complexity","volume":"14","author":"Lin","year":"1997","journal-title":"Neurocomputing"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Kristo, A., Vaidya, K., \u00c7etintemel, U., Misra, S., and Kraska, T. (2020, January 14\u201319). The case for a learned sorting algorithm. Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, Portland, OR, USA.","DOI":"10.1145\/3318464.3389752"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., and Polyzotis, N. (July, January 30). The case for learned index structures. Proceedings of the 2018 International Conference on Management of Data, Amsterdam, The Netherlands.","DOI":"10.1145\/3183713.3196909"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"8138","DOI":"10.1109\/ACCESS.2016.2619181","article-title":"MLP neural network based gas classification system on Zynq SoC","volume":"4","author":"Zhai","year":"2016","journal-title":"IEEE Access"},{"key":"ref_17","unstructured":"Antonyus, P.D.A., and Barros, E.N.D.S. (2010, January 12\u201315). A high performance full pipelined arquitecture of MLP neural networks in FPGA. Proceedings of the 2010 17th IEEE International Conference on Electronics, Circuits and Systems, Athens, Greece."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"20170735","DOI":"10.1587\/elex.14.20170735","article-title":"Optimized sorting network for successive cancellation list decoding of polar codes","volume":"14","author":"Wang","year":"2017","journal-title":"IEICE Electron. Express"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/2\/200\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:10:53Z","timestamp":1760119853000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/2\/200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,19]]},"references-count":18,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,2]]}},"alternative-id":["e25020200"],"URL":"https:\/\/doi.org\/10.3390\/e25020200","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,1,19]]}}}