{"title":"一种改进的简化极化码连续消列译码","authors":"Yu Guo, Shufeng Li, Mingyu Cai","doi":"10.1109/CCET55412.2022.9906321","DOIUrl":null,"url":null,"abstract":"The Successive-Cancellation List (SCL) algorithm is a popular decoding algorithm for polar codes. Although SCL algorithm overcomes the error propagation problem in polar codes decoding, the improvement of error correction performance needs to pay the price of high latency. To solve this problem, a simplified SCL (SSCL) algorithm is proposed. For some special nodes, the SSCL algorithm can calculate path metric (PM) without traversing the decoding tree to achieve direct decoding, reducing the latency and complexity of decoding. In this paper, a new special node has been discovered, it is also possible to calculate PM without traversing decoding tree. Based on this, we propose an improved SSCL algorithm. Simulation results show that improved SSCL algorithm can further reduce the decoding latency and the loss of error-correction performance is negligible.","PeriodicalId":329327,"journal":{"name":"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved Simplified Successive-Cancellation List Decoding of Polar Codes\",\"authors\":\"Yu Guo, Shufeng Li, Mingyu Cai\",\"doi\":\"10.1109/CCET55412.2022.9906321\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Successive-Cancellation List (SCL) algorithm is a popular decoding algorithm for polar codes. Although SCL algorithm overcomes the error propagation problem in polar codes decoding, the improvement of error correction performance needs to pay the price of high latency. To solve this problem, a simplified SCL (SSCL) algorithm is proposed. For some special nodes, the SSCL algorithm can calculate path metric (PM) without traversing the decoding tree to achieve direct decoding, reducing the latency and complexity of decoding. In this paper, a new special node has been discovered, it is also possible to calculate PM without traversing decoding tree. Based on this, we propose an improved SSCL algorithm. Simulation results show that improved SSCL algorithm can further reduce the decoding latency and the loss of error-correction performance is negligible.\",\"PeriodicalId\":329327,\"journal\":{\"name\":\"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCET55412.2022.9906321\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 5th International Conference on Computer and Communication Engineering Technology (CCET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCET55412.2022.9906321","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Simplified Successive-Cancellation List Decoding of Polar Codes
The Successive-Cancellation List (SCL) algorithm is a popular decoding algorithm for polar codes. Although SCL algorithm overcomes the error propagation problem in polar codes decoding, the improvement of error correction performance needs to pay the price of high latency. To solve this problem, a simplified SCL (SSCL) algorithm is proposed. For some special nodes, the SSCL algorithm can calculate path metric (PM) without traversing the decoding tree to achieve direct decoding, reducing the latency and complexity of decoding. In this paper, a new special node has been discovered, it is also possible to calculate PM without traversing decoding tree. Based on this, we propose an improved SSCL algorithm. Simulation results show that improved SSCL algorithm can further reduce the decoding latency and the loss of error-correction performance is negligible.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
