Shift Pruning-Based SCL Decoding for Polar Codes

Desheng Wang, Jihang Yin (), Yonggang Xu (), Xuan Yang, Jiaqi Yan and Gang Hua
Additional contact information
Desheng Wang: Faculty of Electronic Information Engineering, Huaiyin Institute of Technology, Huaian 223003, China
Jihang Yin: School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 101408, China
Yonggang Xu: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China
Xuan Yang: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China
Jiaqi Yan: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China
Gang Hua: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China

Mathematics, 2024, vol. 12, issue 18, 1-16

Abstract: 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 ( P M R ) , 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.

Keywords: polar codes; successive cancellation list decoding; shift pruning algorithm; shift-position determination (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/12/18/2937/pdf (application/pdf)
https://www.mdpi.com/2227-7390/12/18/2937/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:12:y:2024:i:18:p:2937-:d:1482633

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().