Scholarlink

<p>Large kernel polar codes demonstrate exceptional error-correction capabilities in finite-length coding, making them promising candidates for enabling 6G’s ultra-high reliability and ultra-low latency communication (URLLC) requirements. However, the decoding complexity exhibits exponential growth relative to the kernel dimension. In this paper, we study Tanner-graph-assisted (TGA) serial decoding to further reduce complexity without sacrificing error-correction performance. We first establish the standard for the Tanner graph to satisfy serial decoding and give rigorous proof. In particular, a gamified worm search scheme is designed, which makes the proposed standard practical for screening Tanner graphs by accurately tracking the worm’s running trajectory in the node matrix. Then, we construct a low-complexity serial TGA successive cancellation (TGA-SC) decoder. The decoder takes the kernel matrix that satisfies both the standard and the optimal polarization exponent as the Tanner graph. Moreover, the serial decoding equations for arbitrary dimensional linear binary kernels are derived. Numerical results demonstrate that our scheme achieves significant error-correction improvement compared to classic polar codes while maintaining similar complexity.</p>

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

Tanner-graph-assisted successive cancellation decoding for large kernel polar codes

  • 期刊论文

  • 发表日期：

    2026年3月31日

查看全文
  • Yangyang Liu,
  • Yu Zhang,
  • Liuchang Yang,
  • Lixia Xiao,
  • Tao Jiang

摘要

Large kernel polar codes demonstrate exceptional error-correction capabilities in finite-length coding, making them promising candidates for enabling 6G’s ultra-high reliability and ultra-low latency communication (URLLC) requirements. However, the decoding complexity exhibits exponential growth relative to the kernel dimension. In this paper, we study Tanner-graph-assisted (TGA) serial decoding to further reduce complexity without sacrificing error-correction performance. We first establish the standard for the Tanner graph to satisfy serial decoding and give rigorous proof. In particular, a gamified worm search scheme is designed, which makes the proposed standard practical for screening Tanner graphs by accurately tracking the worm’s running trajectory in the node matrix. Then, we construct a low-complexity serial TGA successive cancellation (TGA-SC) decoder. The decoder takes the kernel matrix that satisfies both the standard and the optimal polarization exponent as the Tanner graph. Moreover, the serial decoding equations for arbitrary dimensional linear binary kernels are derived. Numerical results demonstrate that our scheme achieves significant error-correction improvement compared to classic polar codes while maintaining similar complexity.