基于循环冗余校验的极化码低复杂度球形译码算法  

Low complexity spherical decoding algorithm for polar code based on cyclic redundancy check

作　　者：马成翀 穆航 马征[1] MA Chengchong;MU Hang;MA Zheng(Kay Lab of Information Coding and Transmission of Sichuan Province,Southwest Jiaotong University,Chengdu 611756,P.R.China;Southwest China Institute of Electronic Technology,Chengdu 610036,P.R.China)

机构地区：[1]西南交通大学信息编码与传输四川省重点实验室,成都611756 [2]中国西南电子技术研究所,成都610036

出　　处：《重庆邮电大学学报（自然科学版）》2024年第5期888-895,共8页Journal of Chongqing University of Posts and Telecommunications(Natural Science Edition)

基　　金：四川省自然基金重点项目(2022NSFSC0043)。

摘　　要：球形译码是实现极化码最大似然译码性能的有效算法。针对球形译码算法复杂度高的问题,提出了一种基于循环冗余校验固定部分比特降低极化码球形译码算法复杂度的方案。通过使用循环冗余校验码校验固定球形译码译码顺序中位置靠前的根节点,大量减少总的搜索节点,降低算法的复杂度;通过对提出算法的复杂度进行理论推导分析,获得了复杂度降低的解析式,以及编码信息位长度、固定比特长度对降低复杂度影响的关系。仿真验证表明,提出算法可以在大幅度降低球形译码算法复杂度的同时保证较好的性能。Spherical decoding is an effective decoding algorithm to achieve the maximum likelihood decoding performance of polar codes.This paper proposes a scheme using cyclic redundancy check(CRC)to reduce the complexity of the sphere decoding algorithm of polar codes.The proposed algorithm uses the decoding result of SC decoding and then employs CRC check to fix some root nodes in the front position of the decoding order of spherical decoding,greatly reducing the number of search nodes and thereby lowering the complexity of the algorithm.The theoretical analysis of reduced complexity is conducted.The theoretical derivation and analysis of the proposed algorithm’s complexity yield an analytical expression for the reduction in complexity,along with the relationship between the length of information bits and the length of fixed bits in relation to the complexity reduction.Simulation results demonstrate that the proposed algorithm can significantly reduce the complexity of sphere decoding while ensuring good performance.

关 键 词：球形译码 极化码 循环冗余校验码 

分 类 号：TN911.22[电子电信—通信与信息系统]