基于BCJR网格的3×3核极化码简化连续消去译码算法  

3×3 Polar Code Simplified Successive Cancellation DecodingAlgorithm Based on BCJR Trellis Construction

作　　者：李逸飞 黄志亮[1] 张莜燕 周水红[1] LI Yifei;HUANG Zhiliang;ZHANG Youyan;ZHOU Shuihong(College of Physics and Electronic Information Engineering,Zhejiang Normal University,Jinhua 321004,China)

机构地区：[1]浙江师范大学物理与电子信息工程学院,浙江金华321004

出　　处：《无线电通信技术》2024年第1期181-186,共6页Radio Communications Technology

摘　　要：大核矩阵极化码的传统连续消去(Successive Cancellation, SC)译码算法有较高的计算复杂度,采用网格来降低大核矩阵极化码SC译码算法的复杂度。发现了SC译码算法核内部运算和网格的联系,建立了相应的网格替代核内部运算,基于BCJR(Bahl, Cocke, Jelinek, Raviv construction)网格构造出SC核内部运算的最小网格。有效降低了算法计算量。仿真结果表明,3×3核的长度为243、码率为1/2的极化码,相比于直接计算式,运行时间减少了79.14%,节省了14.2%的计算成本。The traditional Successive Cancellation(SC)decoding algorithm for large kernel matrix polar codes has high computational complexity.This paper uses a trellis to reduce the complexity of the SC decoding algorithm for large kernel matrix polar codes.Firstly,this paper establishes the connection between the internal operations of the SC decoding algorithm and the trellis.Then,it establishes the corresponding trellis-based replacements for internal operations.Finally,based on the BCJR(Bahl,Cocke,Jelinek,Raviv construction)trellis,the minimum trellis for internal operations of the SC kernel is constructed.This approach effectively reduces the computational load of the algorithm.Simulation results show that for 3×3 kernel polar codes with a length of 243 and a code rate of 1/2,this method reduces the running time by 79.14%compared to direct calculation,savings of 14.2%in computing costs.

关 键 词：极化码 大核矩阵 BCJR网格 连续消去译码 

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