IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v12y2024i18p2937-d1482633.html
   My bibliography  Save this article

Shift Pruning-Based SCL Decoding for Polar Codes

Author

Listed:
  • 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)

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.

Suggested Citation

  • Desheng Wang & Jihang Yin & Yonggang Xu & Xuan Yang & Jiaqi Yan & Gang Hua, 2024. "Shift Pruning-Based SCL Decoding for Polar Codes," Mathematics, MDPI, vol. 12(18), pages 1-16, September.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2937-:d:1482633
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/18/2937/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/18/2937/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:12:y:2024:i:18:p:2937-:d:1482633. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.