Multi-Bit Successive Cancellation List Decoding of Polar Codes Using One-Bit Error Boundary

IF 3.7 3区计算机科学 Q2 TELECOMMUNICATIONS

IEEE Communications Letters Pub Date : 2025-04-16 DOI:10.1109/LCOMM.2025.3561246

In-Cheol Park;Seungju Woo;Jaeyoung Lee;Minha Park;Sangbeom Park

引用次数: 0

Abstract

This letter proposes an efficient method to reduce path splits in the successive cancellation list (SCL) decoding. We construct the boundary consisting of single-bit and multi-bit nodes that have a low error probability within the SC-decoding tree. The nodes on the boundary are considered with only two candidates per path instead of descending to their child nodes. To establish the boundary, we investigate the error probability of multi-bit nodes in the SC-decoding tree. The proposed method reduces the overall decoding cycles by approximately 70% while maintaining almost the same error-correcting performance as the conventional SCL decoding method.

查看原文本刊更多论文

基于1位误差边界的极性码的多位连续对消列表译码

本文提出了一种有效的方法来减少连续取消列表（SCL）解码中的路径分裂。我们在sc解码树中构造了由单比特和多比特节点组成的边界，这些节点具有低的错误概率。边界上的节点被认为每条路径只有两个候选节点，而不是下降到它们的子节点。为了建立边界，我们研究了sc解码树中多比特节点的错误概率。该方法在保持与传统SCL译码方法几乎相同的纠错性能的同时，将总译码周期减少了约70%。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE Communications Letters 工程技术-电信学

CiteScore

8.10

自引率

7.30%

发文量

590

审稿时长

2.8 months

期刊介绍： The IEEE Communications Letters publishes short papers in a rapid publication cycle on advances in the state-of-the-art of communication over different media and channels including wire, underground, waveguide, optical fiber, and storage channels. Both theoretical contributions (including new techniques, concepts, and analyses) and practical contributions (including system experiments and prototypes, and new applications) are encouraged. This journal focuses on the physical layer and the link layer of communication systems.