基于多段CRC和部分路径拓展的极化码译码算法  

Decoding Algorithm of Polarization Code Based on Multi-segment CRC and Partial Path Expansion

作　　者：付辰轩 武霄泳 费聚锋 林加涛 张志龙[1] FU Chen-xuan;WU Xiao-yong;FEI Ju-feng;LIN Jia-tao;ZHANG Zhi-long(Beijing University of Posts and Telecommunications,Beijing 100876,China;Shanghai Radio Equipment Research Institute,Shanghai 201109,China)

机构地区：[1]北京邮电大学,北京100876 [2]上海无线电设备研究所,上海201109

出　　处：《制导与引信》2021年第4期45-51,共7页Guidance & Fuze

基　　金：上海航天科技创新基金(SAST2020-051);陕西省重点研发计划(2019ZDLGY07-10)。

摘　　要：为了兼顾极化码译码算法的性能和复杂度,提出了一种基于多段循环冗余校验(cyclic redundancy check,CRC)和部分路径拓展的极化码译码算法。该算法基于部分路径拓展的思路,通过计算译码比特的对数似然比及其期望的定量关系,自适应选择硬判决模式或者路径拓展模式。在此基础上,设计了五种校验位分段策略,通过将信息比特分成多段并在其后添加CRC实现算法在复杂度和可靠性之间折中。仿真结果表明,通过设定合理的参数和分段策略,在误帧率达到10^(-4)时,与CRC辅助的连续删除列表译码算法相比,所提算法的复杂度可降低约81%。In order to balance the performance and complexity of polarization code decoding method,a decoding algorithm based on multi-segment cyclic redundancy check(CRC)and partial path expansion is proposed.The algorithm adopts the scheme of partial path expansion,and selects the hard decision mode or path expansion mode adaptively by comparing the logarithmic likelihood ratio of decoded bits and its expected value.Five check bit segmentation strategies are designed.By dividing the message bits into multiple segments and adding CRC after them,the algorithm realizes the compromise between complexity and reliability.Simulation results show that by setting reasonable parameters and segmentation strategy,the complexity of the proposed algorithm can be reduced by 81% compared with CRC-aided successive cancellation list decoding algorithm when the frame error rate is 10^(-4).

关 键 词：极化码译码 低复杂度 循环冗余校验 部分路径拓展 误帧率 

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