电子科技大学学报2026，Vol.28Issue(4)：565-570,6.DOI:10.12178/1001-0548.2025200
基于奇偶校验和循环冗余校验的增强Fast-SCL译码算法
Enhanced fast-SCL decoding based on parity check and cyclic redundancy check
韩国军 1董鹏 1曾子峰 1翟雄飞 1史治平2
作者信息
- 1. 广东工业大学信息工程学院,广州 510006
- 2. 电子科技大学通信抗干扰国家级重点实验室,成都 611731
- 折叠
摘要
Abstract
The fast successive cancellation list(Fast-SCL)decoding algorithm for polar codes can achieve low latency,but still performs poorly under medium and short code lengths.To deal with this issue,this paper proposes an improved Fast-SCL algorithm by combining parity check(PC)and cyclic redundancy check(CRC).Specifically,PC bits are introduced into the Fast-SCL algorithm to enable real-time path verification,which makes the path selection more reliable.Additionally,with the same total number of check bits,various combinations of PC bits and CRC bits are considered.The simulation results demonstrate that the proposed algorithm achieves a performance gain of 0.35 dB and a complexity reduction of 10%compared to the original CRC-assisted Fast-SCL algorithm under the short code lengths with the frame error rate(FER)being10-2.关键词
极化码/特殊节点/快速串行消除列表/奇偶校验/循环冗余校验Key words
polar code/special nodes/Fast-SCL/parity check/cyclic redundancy check分类
信息技术与安全科学引用本文复制引用
韩国军,董鹏,曾子峰,翟雄飞,史治平..基于奇偶校验和循环冗余校验的增强Fast-SCL译码算法[J].电子科技大学学报,2026,28(4):565-570,6.
