.png){kind=icon}
.png){kind=icon}
Return
Multi-attempt list decoding of polar codes
.png){kind=icon}
PRE
AI
Y
C
W
G
DOI：10.23919/jcc.fa.2025-0372.202604.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this work, we propose a multi-attempt successive cancellation list (MA-SCL) decoder for polar codes that achieves identical error-correction performance to standard SCL decoding while reducing average complexity. Unlike CRC-aided SCL, the proposed MA-SCL progressively restarts decoding with increasing list sizes and reuses information from previous attempts. This design eliminates the need for outer CRC codes. The decoder features dynamic search-space pruning and an early stopping criterion based on path metrics. Simulations show MA-SCL matches SCL performance with lower average complexity, particularly for short polar-like codes with reed-muller (RM) rate profiles and dynamic frozen constraints. Compared to existing adaptive decoders, MA-SCL offers implementation advantages by eliminating the need for stack-/heap management while providing relatively stable latency bounds (1 × to |Λ|× SCL latency).
Keywords:
complexity-adaptive decoding
list decoding
polar coding
Journal
IF:
3.1
Papers:
1.8K
Citations:
5.0K
Organization
Cited Papers