Deep Learning-Assisted Adaptive Dynamic-SCLF Decoding of Polar Codes

IF 7.4 1区 计算机科学 Q1 TELECOMMUNICATIONS
Jun Li;Lejia Zhou;Zhengquan Li;Weidong Gao;Ru Ji;Jintao Zhu;Ziyi Liu
{"title":"Deep Learning-Assisted Adaptive Dynamic-SCLF Decoding of Polar Codes","authors":"Jun Li;Lejia Zhou;Zhengquan Li;Weidong Gao;Ru Ji;Jintao Zhu;Ziyi Liu","doi":"10.1109/TCCN.2024.3349450","DOIUrl":null,"url":null,"abstract":"Recently, the dynamic-successive cancellation list flip (D-SCLF) decoder has been proposed to improve the high-order flipping performance of existing successive cancellation list flip (SCLF) decoders in polar codes decoding. However, the D-SCLF decoder involves a large number of exponential and logarithmic operations, resulting in an exponential increase in computational complexity. To further improve the performance and reduce the average complexity of D-SCLF decoding, the deep learning-assisted adaptive dynamic-SCLF (DL-AD-SCLF) decoding is proposed in this paper. The error metric of D-SCLF decoding is re-derived, and an approximation scheme is proposed to reduce computational complexity. To compensate the loss of performance due to approximation, two learnable parameters are introduced. Customized neural network structures are proposed to optimize these learnable parameters according to the improved error metric by employing deep learning (DL), and the deep learning-assisted dynamic-SCLF (DL-D-SCLF) decoding is proposed. Furthermore, the adaptive list is introduced into the DL-D-SCLF decoding to further reduce decoding complexity. Simulation results show that the proposed decoder performance is improved up to 0.35dB and 0.25dB, the average complexity is reduced by up to 57.65% and 51.48% for single-bit and multi-bit flipping, respectively. Additionally, the proposed decoder exhibits good robustness to changes in code rates, code lengths, and channel conditions.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"10 3","pages":"836-851"},"PeriodicalIF":7.4000,"publicationDate":"2024-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cognitive Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10380217/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, the dynamic-successive cancellation list flip (D-SCLF) decoder has been proposed to improve the high-order flipping performance of existing successive cancellation list flip (SCLF) decoders in polar codes decoding. However, the D-SCLF decoder involves a large number of exponential and logarithmic operations, resulting in an exponential increase in computational complexity. To further improve the performance and reduce the average complexity of D-SCLF decoding, the deep learning-assisted adaptive dynamic-SCLF (DL-AD-SCLF) decoding is proposed in this paper. The error metric of D-SCLF decoding is re-derived, and an approximation scheme is proposed to reduce computational complexity. To compensate the loss of performance due to approximation, two learnable parameters are introduced. Customized neural network structures are proposed to optimize these learnable parameters according to the improved error metric by employing deep learning (DL), and the deep learning-assisted dynamic-SCLF (DL-D-SCLF) decoding is proposed. Furthermore, the adaptive list is introduced into the DL-D-SCLF decoding to further reduce decoding complexity. Simulation results show that the proposed decoder performance is improved up to 0.35dB and 0.25dB, the average complexity is reduced by up to 57.65% and 51.48% for single-bit and multi-bit flipping, respectively. Additionally, the proposed decoder exhibits good robustness to changes in code rates, code lengths, and channel conditions.
极地编码的深度学习辅助自适应动态-SCLF 解码
最近,有人提出了动态连续消隐列表翻转(D-SCLF)解码器,以改善现有连续消隐列表翻转(SCLF)解码器在极性码解码中的高阶翻转性能。然而,D-SCLF 解码器涉及大量指数和对数运算,导致计算复杂度呈指数增长。为了进一步提高 D-SCLF 解码的性能并降低其平均复杂度,本文提出了深度学习辅助自适应动态-SCLF(DL-AD-SCLF)解码。本文重新推导了 D-SCLF 解码的误差度量,并提出了一种近似方案来降低计算复杂度。为了弥补近似带来的性能损失,本文引入了两个可学习参数。通过采用深度学习(DL),提出了定制的神经网络结构,以根据改进的误差指标优化这些可学习参数,并提出了深度学习辅助动态-SCLF(DL-D-SCLF)解码。此外,DL-D-SCLF 解码还引入了自适应列表,以进一步降低解码复杂度。仿真结果表明,所提出的解码器性能分别提高了 0.35dB 和 0.25dB,单比特和多比特翻转的平均复杂度分别降低了 57.65% 和 51.48%。此外,拟议的解码器对码率、码长和信道条件的变化表现出良好的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Cognitive Communications and Networking
IEEE Transactions on Cognitive Communications and Networking Computer Science-Artificial Intelligence
CiteScore
15.50
自引率
7.00%
发文量
108
期刊介绍: The IEEE Transactions on Cognitive Communications and Networking (TCCN) aims to publish high-quality manuscripts that push the boundaries of cognitive communications and networking research. Cognitive, in this context, refers to the application of perception, learning, reasoning, memory, and adaptive approaches in communication system design. The transactions welcome submissions that explore various aspects of cognitive communications and networks, focusing on innovative and holistic approaches to complex system design. Key topics covered include architecture, protocols, cross-layer design, and cognition cycle design for cognitive networks. Additionally, research on machine learning, artificial intelligence, end-to-end and distributed intelligence, software-defined networking, cognitive radios, spectrum sharing, and security and privacy issues in cognitive networks are of interest. The publication also encourages papers addressing novel services and applications enabled by these cognitive concepts.
×
引用
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学术官方微信