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.Unlik...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 searchspace 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).展开更多
基金supported by the 2025 Start-up Research Fund(Grant No.JIH2333002Y)from Fudan Universitysupported in part by the Fundamental Research Funds for the Central Universities+3 种基金the Yangtze River Delta Science and Technology Innovation Community Joint Research(Basic Research)Project under Grant BK20244006111 project BP0719010STCSM 22DZ2229005supported by the National Natural Science Foundation of China Grant No.62595745
摘要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 searchspace 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).