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

被引:5
作者
Li, Jun [1 ,2 ]
Zhou, Lejia [2 ]
Li, Zhengquan [3 ]
Gao, Weidong [1 ]
Ji, Ru [2 ]
Zhu, Jintao [2 ]
Liu, Ziyi [2 ]
机构
[1] Wuxi Univ, Coll Elect Informat Engn, Wuxi 214105, Peoples R China
[2] Nanjing Univ Informat Sci & Technol, Sch Elect & Informat Engn, Nanjing 210044, Peoples R China
[3] Jiangnan Univ, Sch Internet Things Engn, Wuxi 214122, Peoples R China
关键词
Polar codes; Estimation; Robustness; Deep learning; successive cancellation list flip (SCLF) decoding; dynamic-SCLF decoding; deep learning; adaptive list; CANCELLATION LIST DECODER; ALGORITHM;
D O I
10.1109/TCCN.2024.3349450
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
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.
引用
收藏
页码:836 / 851
页数:16
相关论文
共 29 条
[1]  
Afisiadis O, 2014, CONF REC ASILOMAR C, P2116, DOI 10.1109/ACSSC.2014.7094848
[2]  
[Anonymous], 2016, 87 3GPP TSG RAN WGI
[3]   Fast Successive-Cancellation-Based Decoders of Polar Codes [J].
Ardakani, Maryam Haghighi ;
Hanif, Muhammad ;
Ardakani, Masoud ;
Tellambura, Chintha .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (07) :4562-4574
[4]   Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].
Arikan, Erdal .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073
[5]   LLR-Based Successive Cancellation List Decoding of Polar Codes [J].
Balatsoukas-Stimming, Alexios ;
Parizi, Mani Bastani ;
Burg, Andreas .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 63 (19) :5165-5179
[6]   Polar Codes for the Rayleigh Fading Channel [J].
Bravo-Santos, Angel .
IEEE COMMUNICATIONS LETTERS, 2013, 17 (12) :2352-2355
[7]   Dynamic-SCFlip Decoding of Polar Codes [J].
Chandesris, Ludovic ;
Savin, Valentin ;
Declercq, David .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (06) :2333-2345
[8]  
Chen CH, 2020, INT CONF ACOUST SPEE, P1708, DOI [10.1109/ICASSP40776.2020.9053222, 10.1109/icassp40776.2020.9053222]
[9]   Bit-Flip Algorithm for Successive Cancellation List Decoder of Polar Codes [J].
Cheng, Fengyi ;
Liu, Aijun ;
Zhang, Yingxian ;
Ren, Jing .
IEEE ACCESS, 2019, 7 :58346-58352
[10]  
Cheng JF, 2000, 2000 IEEE 51ST VEHICULAR TECHNOLOGY CONFERENCE, PROCEEDINGS, VOLS 1-3, P2252, DOI 10.1109/VETECS.2000.851673