Adaptive channel decoding method for polar codes

Q4 Engineering
Maolin Ye, Xiaoqing Tan, Liqing Xu, Shanxiang Lü
{"title":"Adaptive channel decoding method for polar codes","authors":"Maolin Ye, Xiaoqing Tan, Liqing Xu, Shanxiang Lü","doi":"10.3724/sp.j.1249.2022.05521","DOIUrl":null,"url":null,"abstract":"Abstract: The polar code is a channel coding technology which can reach the Shannon limit in theory and has the advantage of low coding and decoding complexity. It is now one of the channel coding solutions in 5G communication. The successive cancellation list (SCL) decoding algorithm is the most commonly used decoding method for polar codes, but it has high memory and time complexity. Fast succesive cancellation (Fast-SC) decoding algorithm can effectively reduce the decoding complexity, but it has the problem of low reliability. In order to take into account the decoding efficiency and reliability of polar codes, a preFast-SCL decoding algorithm for adaptive channels is proposed. The algorithm combines the advantages of Fast-SC and SCL decoding algorithms. At the beginning of decoding, the Fast-SC algorithm is used to quickly obtain a group of decoding results and verify them. If the verification is passed, it will be outputed as the result, but if not, SCL decoding will be used to ensure the reliability. Simulation results show that the complexity of preFast-SCL decoding algorithm decreases gradually with the improvement of channel conditions. In additive white Gaussian noise channel, the reliability of preFast-SCL is basically the same as that of SCL decoding algorithm. When the signal to noise ratio (SNR) is 2. 0 dB, the decoding complexity of preFast-SCL is reduced by 45% compared with SCL, and the time performance gain is better under the condition of higher SNR.","PeriodicalId":35396,"journal":{"name":"Shenzhen Daxue Xuebao (Ligong Ban)/Journal of Shenzhen University Science and Engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Shenzhen Daxue Xuebao (Ligong Ban)/Journal of Shenzhen University Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3724/sp.j.1249.2022.05521","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract: The polar code is a channel coding technology which can reach the Shannon limit in theory and has the advantage of low coding and decoding complexity. It is now one of the channel coding solutions in 5G communication. The successive cancellation list (SCL) decoding algorithm is the most commonly used decoding method for polar codes, but it has high memory and time complexity. Fast succesive cancellation (Fast-SC) decoding algorithm can effectively reduce the decoding complexity, but it has the problem of low reliability. In order to take into account the decoding efficiency and reliability of polar codes, a preFast-SCL decoding algorithm for adaptive channels is proposed. The algorithm combines the advantages of Fast-SC and SCL decoding algorithms. At the beginning of decoding, the Fast-SC algorithm is used to quickly obtain a group of decoding results and verify them. If the verification is passed, it will be outputed as the result, but if not, SCL decoding will be used to ensure the reliability. Simulation results show that the complexity of preFast-SCL decoding algorithm decreases gradually with the improvement of channel conditions. In additive white Gaussian noise channel, the reliability of preFast-SCL is basically the same as that of SCL decoding algorithm. When the signal to noise ratio (SNR) is 2. 0 dB, the decoding complexity of preFast-SCL is reduced by 45% compared with SCL, and the time performance gain is better under the condition of higher SNR.
极化码的自适应信道解码方法
摘要:极性编码是一种理论上可以达到香农极限的信道编码技术,具有编码和解码复杂度低的优点。目前已成为5G通信中的信道编码解决方案之一。SCL译码算法是目前最常用的极化码译码方法,但它具有较高的存储复杂度和时间复杂度。快速连续对消(Fast- sc)译码算法可以有效降低译码复杂度,但存在可靠性低的问题。为了兼顾极化码的译码效率和可靠性,提出了一种适用于自适应信道的preFast-SCL译码算法。该算法结合了Fast-SC和SCL译码算法的优点。在解码开始时,使用Fast-SC算法快速获取一组解码结果并对其进行验证。如果验证通过,将作为结果输出,如果不通过,将使用SCL解码来确保可靠性。仿真结果表明,随着信道条件的改善,pre - fast - scl译码算法的复杂度逐渐降低。在加性高斯白噪声信道中,preFast-SCL的可靠性与SCL译码算法的可靠性基本一致。当信噪比为2时。在高信噪比条件下,preFast-SCL的解码复杂度比SCL降低45%,时间性能增益更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.90
自引率
0.00%
发文量
14
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信