Scholarlink

<p>The successive cancellation list (SCL) decoding algorithm has attracted significant interest in polar code due to its superior performance by retaining multiple decoding paths with increasing the complexity of decoding. To reduce the decoding complexity, we propose two low-complexity SCL decoding algorithms, including the codewords grouping-based threshold modified sequential probability ratio test (CG-TMSPRT) algorithm and the bit-based threshold modified sequential probability ratio test (B-TMSPRT) algorithm. Both algorithms trim some decoding paths by the proposed splitting rules, which consider adaptive double thresholds for the SCL decoding procedure. Based on the SCL decoding procedure, the CG-TMSPRT algorithm considers double thresholds, which vary with the group of code length, while the B-TMSPRT algorithm changes double thresholds with decoding bit according to Gaussian approximation. The simulation results show that both proposed algorithms significantly reduce the decoding complexity while keeping good decoding performance. Compared with the CG-TMSPRT algorithm, the B-TMSPRT algorithm has better decoding performance and higher computational complexity.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A low-complexity successive cancellation list decoding for polar codes with variable thresholds

  • 期刊论文

  • 发表日期：

    2025年7月29日

查看全文
  • Liping Du,
  • Ping An,
  • Xiaoyun Hou,
  • Yueyun Chen

摘要

The successive cancellation list (SCL) decoding algorithm has attracted significant interest in polar code due to its superior performance by retaining multiple decoding paths with increasing the complexity of decoding. To reduce the decoding complexity, we propose two low-complexity SCL decoding algorithms, including the codewords grouping-based threshold modified sequential probability ratio test (CG-TMSPRT) algorithm and the bit-based threshold modified sequential probability ratio test (B-TMSPRT) algorithm. Both algorithms trim some decoding paths by the proposed splitting rules, which consider adaptive double thresholds for the SCL decoding procedure. Based on the SCL decoding procedure, the CG-TMSPRT algorithm considers double thresholds, which vary with the group of code length, while the B-TMSPRT algorithm changes double thresholds with decoding bit according to Gaussian approximation. The simulation results show that both proposed algorithms significantly reduce the decoding complexity while keeping good decoding performance. Compared with the CG-TMSPRT algorithm, the B-TMSPRT algorithm has better decoding performance and higher computational complexity.