An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes

Desheng Wang, Jihang Yin (), Yonggang Xu (), Xuan Yang, Qiuwei Xu and Gang Hua
Additional contact information
Desheng Wang: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China
Jihang Yin: School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing 100049, 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
Qiuwei Xu: College of Information Engineering, Yangzhou University, Yangzhou 225127, China
Gang Hua: School of Information and Control Engineering, China University of Mining and Technology, Xuzhou 221116, China

Mathematics, 2023, vol. 11, issue 21, 1-19

Abstract: Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal. As a mainstream decoding algorithm for polar codes, the successive cancellation list (SCL) decoder usually improves the error correction performance by increasing the list size, but this method suffers from the problems of high decoding complexity. To address this problem, this paper proposes a layered-search bit-flipping (LS-SCLF) decoding algorithm based on SCL decoding. Firstly, a new flip-bit metric is proposed, which derives a formula to approximate the probability of an error occurring in an information bit. This formula introduces a perturbation parameter to improve the calculation accuracy. Secondly, a compromise scheme for determining the perturbation parameter is proposed. The scheme uses Monte Carlo simulation to determine an optimized parameter for the precise positioning of the first erroneous decoded bit under different decoding conditions. Finally, a layered search strategy is adopted to sequentially search the erroneous decoded bits from the low order to high order, which can correct up to multiple bits at the same time. Simulation results show that the proposed algorithm achieves improved error correction performance with a slight increase in decoding complexity compared to the generalized SCL-Flip (GSCLF) decoding algorithm. This algorithm also achieves a good balance between the error correction performance and decoding complexity.

Keywords: 5G; polar codes; successive cancellation list decoder; bit-flipping algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/21/4462/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/21/4462/ (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:11:y:2023:i:21:p:4462-:d:1269064

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 ().