基于校正搜索宽度的极化码译码算法研究  

Research on Polar Code Decoding Algorithm Based on Correcting Search Width

作　　者：卢丽金 郑鑫[1] 张晓洁[1] 李家海 廖东凤 Lu Lijin;Zheng Xin;Zhang Xiaojie;Li Jiahai;Liao Dongfeng(College of Mathematics,Physics and Electronic Information Engineering,Guangxi Normal University for Nationalities,Chongzuo 532200)

机构地区：[1]广西民族师范学院数理与电子信息工程学院,崇左532200

出　　处：《现代计算机》2021年第36期15-21,共7页Modern Computer

基　　金：广西民族师范学院科研经费资助项目(2020YB003)。

摘　　要：Polar码是目前仅有的一种在数学上被严格证明且能够实现香农信道容量的一种信道编码方式。但是,在译码方面依然存在严重的时延问题。针对存在的问题,提出基于校正搜索宽度的极化码译码算法。该算法采用跟踪历史数据、采集历史数据以及对合格历史数据进行数学运算的方法,不断调整、校正搜索宽度,降低执行串行抵消列表译码的次数,进而降低解码时延,提高解码效率。仿真结果表明,该算法能显著地降低解码代价和时延,且保持性能不变。Polar code is currently the only channel coding method that has been strictly mathematically proven and can achieve the Shannon channel capacity. However, there is still a serious time delay problem in decoding. Aiming at the problem of high latency,this paper proposes a polar code decoding algorithm based on the corrected search width. The algorithm uses methods of tracking historical data, collecting historical data, and performing mathematical operations on qualified historical data to continuously adjust and correct the search width and reduce the number of times to perform successive cancellation list decoding. Thereby, the delay of the polar code decoding is reduced, and the decoding efficiency is improved. The simulation results show that the algorithm can significantly reduce the decoding cost and delay while keeping the performance unchanged.

关 键 词：极化码 历史数据 串行抵消列表译码 搜索宽度 时延 

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