Shift Pruning-Based SCL Decoding for Polar Codes

被引:0
作者
Wang, Desheng [1 ]
Yin, Jihang [2 ]
Xu, Yonggang [3 ]
Yang, Xuan [3 ]
Yan, Jiaqi [3 ]
Hua, Gang [3 ]
机构
[1] Huaiyin Inst Technol, Fac Elect Informat Engn, Huaian 223003, Peoples R China
[2] Univ Chinese Acad Sci, Sch Comp Sci & Technol, Beijing 101408, Peoples R China
[3] China Univ Min & Technol, Sch Informat & Control Engn, Xuzhou 221116, Peoples R China
基金
中国国家自然科学基金;
关键词
polar codes; successive cancellation list decoding; shift pruning algorithm; shift-position determination; ALGORITHM;
D O I
10.3390/math12182937
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In the context of the high-speed development of 5G communications, high-performance decoding schemes for polar codes are a hot spot in channel coding research. Shift pruning successive cancellation list (SP-SCL) decoding aims to recover the correct path by shift pruning in the extra SCL decoding. However, the current SP-SCL decoding is inflexible in determining the shift positions. In this paper, a flexible shift pruning SCL (FSP-SCL) decoding is proposed. Firstly, the reasons for movement and the eliminated states of the correct path are analyzed in detail using the path metric range (PMR), and on this basis, the validity of the method adopted in this paper for determining the shift priority of the information bits is verified. Secondly, the FSP-SCL decoding proposes two methods for determining the shift positions. One is the log-likelihood ratio (LLR) threshold method, which compares the LLR values of the eliminated paths on the shift bit with the corresponding LLR threshold to determine the shift positions. The other is the path distance method. It combines the minimum distance between the eliminated paths and the received vector with the path metrics to determine the shift positions. Both methods are more flexible and practical, as they can calculate the corresponding shift positions online based on a specific shift bit, avoiding the high complexity caused by the simulation method. Finally, this paper designs various experimental schemes to verify the decoding performance of the FSP-SCL. The experimental results show that in terms of error-correction performance, the LLR threshold-based FSP-SCL (FSPL (LLR threshold)) decoding, the path distance-based FSP-SCL (FSPL (path distance)) decoding and the existing SP-SCL decoding are roughly equal overall. In terms of decoding complexity, FSPL (LLR threshold) decoding is slightly better than FSPL (path distance) decoding, and the decoding complexity of both is lower than that of SP-SCL decoding, with the difference being more pronounced in the medium to high SNR regions.
引用
收藏
页数:16
相关论文
共 50 条
  • [21] Low-Latency SCL Bit-Flipping Decoding of Polar Codes
    Zhang, Wei
    Wu, Xiaofu
    ICC 2023-IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2023, : 132 - 135
  • [22] Double-Parity-Check CA-SCL Encoding and Decoding for Polar Codes
    Yuan, Fang
    Tian, Bin
    PROCEEDINGS OF 2018 14TH IEEE INTERNATIONAL CONFERENCE ON SIGNAL PROCESSING (ICSP), 2018, : 747 - 751
  • [23] Threshold Based D-SCFlip Decoding of Polar Codes
    Wang, Desheng
    Yin, Jihang
    Xu, Yonggang
    Yang, Xuan
    Hua, Gang
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2023, E106B (08) : 635 - 644
  • [24] A Reinforcement Learning Based Decoding Method of Short Polar Codes
    Gao, Jian
    Niu, Kai
    2021 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE WORKSHOPS (WCNCW), 2021,
  • [25] Soft List Decoding of Polar Codes
    Xiang, Luping
    Liu, Yusha
    Egilmez, Zeynep B. Kaykac
    G. Maunder, Robert
    Yang, Lie-Liang
    Hanzo, Lajos
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2020, 69 (11) : 13921 - 13926
  • [26] Tailored List Decoding of Polar Codes
    Ellouze, Malek
    Leroux, Camille
    Tajan, Romain
    Poulliat, Charly
    Jego, Christophe
    2021-11TH INTERNATIONAL SYMPOSIUM ON TOPICS IN CODING (ISTC'21), 2021,
  • [27] Stepped List Decoding for Polar Codes
    Rowshan, Mohammad
    Viterbo, Emanuele
    PROCEEDINGS OF 2018 IEEE 10TH INTERNATIONAL SYMPOSIUM ON TURBO CODES & ITERATIVE INFORMATION PROCESSING (ISTC), 2018,
  • [28] Near Optimal Decoding of Polar-based Turbo Product Codes
    Ruan, Meng
    Jiang, Ming
    Zou, Tao
    Sun, Yi
    Zhao, Chunming
    2019 11TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS AND SIGNAL PROCESSING (WCSP), 2019,
  • [29] Sequential Decoding of Polar Codes
    Miloslavkaya, V.
    Trifonov, P.
    IEEE COMMUNICATIONS LETTERS, 2014, 18 (07) : 1127 - 1130
  • [30] List Decoding of Polar Codes
    Tal, Ido
    Vardy, Alexander
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2015, 61 (05) : 2213 - 2226