基于关键集合校验辅助的极化码SCLF译码算法
A critical set check assisted decoding algorithm for polar code SCLF
孙荷 1郭锐1
作者信息
- 1. 杭州电子科技大学通信工程学院,浙江 杭州 310018
- 折叠
摘要
为了降低 SCLF 译码算法的复杂度,提出了一种基于关键集合校验辅助的极化码 SCLF(Parity Check Successive Cancellation List Flip,PC-SCLF)译码算法.该算法关键集合的信息位进行奇偶校验,当关键集合的信息位不满足奇偶校验时,提前终止本轮译码,减少后续无效的译码过程,降低了译码复杂度.仿真结果表明,PC-SCLF 译码算法的性能和现有的化码 SCLF 译码算法相比略有提升,且译码复杂度降低了 5.37%～23.6%.
Abstract
In order to reduce the complexity of Successive Cancellation List Flip(SCLF)decoding algorithm,a critical set check assisted SCLF decoding algorithm for polar code is proposed.The algorithm reduces the decoding complexity by parity-checking(PC)the information bits of the critical set and terminating the current round of decoding in advance when the information bits of the critical set do not satisfy the parity-check,which reduces the subsequent invalid decoding process.Simulation results show that the performance of the proposed PC-SCLF decoding algorithm is slightly improved compared with the existing SCLF decoding algorithm,and the decoding complexity is reduced by 5.37%～23.6%.
关键词
极化码/串行抵消列表翻转/关键集合/奇偶校验/循环冗余校验Key words
polar code/successive cancellation list flip/critical set/parity check/cyclic redundancy check引用本文复制引用
出版年
2024
NETL
NSTL
万方数据