Soft-Output Successive Cancellation List Decoding

被引:0
|
作者
Yuan, Peihong [1 ]
Duffy, Ken R. [2 ]
Medard, Muriel [1 ]
机构
[1] MIT, Network Coding & Reliable Commun Grp, Cambridge, MA 02139 USA
[2] Northeastern Univ, Engn Probabil Informat & Commun Lab, Boston, MA 02115 USA
关键词
Maximum likelihood decoding; Codes; Polar codes; Iterative decoding; Approximation algorithms; Heuristic algorithms; Error analysis; Vectors; Encoding; Convolutional codes; Polar coding; codebook probability; generalized decoding; joint error correction and detection; soft-input soft-output (SISO) decoding; POLAR CODES; DESIGN;
D O I
10.1109/TIT.2024.3512412
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We introduce an algorithm for approximating the codebook probability that is compatible with all successive cancellation (SC)-based decoding algorithms, including SC list (SCL) decoding. This approximation is based on an auxiliary distribution that mimics the dynamics of decoding algorithms with an SC decoding schedule. Based on this codebook probability and SCL decoding, we introduce soft-output SCL (SO-SCL) to generate both blockwise and bitwise soft-output (SO). Using that blockwise SO, we first establish that, in terms of both block error rate (BLER) and undetected error rate (UER), SO-SCL decoding of dynamic Reed-Muller (RM) codes significantly outperforms the CRC-concatenated polar codes from 5G New Radio under SCL decoding. Moreover, using SO-SCL, the decoding misdetection rate (MDR) can be constrained to not exceed any predefined value, making it suitable for practical systems. Proposed bitwise SO can be readily generated from blockwise SO via a weighted sum of beliefs that includes a term where SO is weighted by the codebook probability, resulting in a soft-input soft-output (SISO) decoder. Simulation results for SO-SCL iterative decoding of product codes and generalized LDPC (GLDPC) codes, along with information-theoretical analysis, demonstrate significant superiority over existing list-max and list-sum approximations.
引用
收藏
页码:1007 / 1017
页数:11
相关论文
共 50 条
  • [1] Soft-Output Successive Cancellation Stack Polar Decoder
    Xiang, Luping
    Liu, Yusha
    Maunder, Robert G.
    Yang, Lie-Liang
    Hanzo, Lajos
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (06) : 6238 - 6243
  • [2] Fast Iterative Soft-Output List Decoding of Polar Codes
    Shen, Yifei
    Zhou, Wenyue
    Huang, Yongming
    Zhang, Zaichen
    You, Xiaohu
    Zhang, Chuan
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2022, 70 : 1361 - 1376
  • [3] Soft-input soft-output list-based decoding algorithm
    Martin, PA
    Taylor, DP
    Fossorier, MPC
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 339 - 339
  • [4] Soft-input soft-output list-based decoding algorithm
    Martin, PA
    Taylor, DP
    Fossorier, MPC
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (02) : 252 - 262
  • [5] List successive cancellation decoding of polar codes
    Chen, K.
    Niu, K.
    Lin, J. R.
    ELECTRONICS LETTERS, 2012, 48 (09) : 500 - U52
  • [6] Soft-Output Guessing Codeword Decoding
    Duffy, Ken R.
    Yuan, Peihong
    Griffin, Joseph
    Medard, Muriel
    IEEE COMMUNICATIONS LETTERS, 2025, 29 (02) : 328 - 332
  • [7] Improved Linear Soft-Input Soft-Output Detection via Soft Feedback Successive Interference Cancellation
    Choi, Jun Won
    Singer, Andrew C.
    Lee, Jungwoo
    Cho, Nam Ik
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2010, 58 (03) : 986 - 996
  • [8] Soft-Input Soft-Output Sphere Decoding
    Studer, Christoph
    Boelcskei, Helmut
    2008 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-6, 2008, : 2007 - +
  • [9] Parallel Concatenated Systematic Polar Code Based on Soft Successive Cancellation List Decoding
    Liu, Zhenzhen
    Niu, Kai
    Lin, Jiaru
    2017 20TH INTERNATIONAL SYMPOSIUM ON WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS (WPMC), 2017, : 181 - 184
  • [10] Enhanced Successive Cancellation List Decoding of Polar Codes
    Shi, Sha
    Han, Bing
    Gao, Jing-Liang
    Wang, Yun-Jiang
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (06) : 1233 - 1236