3×3核矩阵极化码的BP译码算法  

BP Decoding Algorithm for 3×3 Kernel Matrix Polar Codes

作　　者：邱开虎 黄志亮[1] 张莜燕 周水红[1] QIU Kaihu;HUANG Zhiliang;ZHANG Youyan;ZHOU Shuihong(College of Physics and Electronic Information Engineering,Zhejiang Normal University,Jinhua 321004,China)

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

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

摘　　要：相比于2×2核极化码,3×3核极化码的码长更加丰富以及有着更高的极化速率。同时,极化码的置信传播(Belief Propagation, BP)算法相比于传统串行消去(Successive Cancellation, SC)译码算法具有更低的延时。将2×2核极化码的BP译码算法推广至3×3核。获得了3×3核内部最小计算单元的信息更新公式;基于信息更新公式,给出了3×3核的BP译码算法。仿真结果表明,对于3×3核极化码,BP译码算法相比于SC译码算法,在中低信噪比下性能要优于SC译码算法。在译码性能相当的条件下,BP译码算法有着更低的译码延时。Compared with 2×2 kernel polar codes,3×3 kernel polar codes have richer code lengths and higher polarization rates.At the same time,Belief Propagation(BP)algorithm for polar codes,as opposed to the traditional Successive Cancellation(SC)decoding algorithm,demonstrates lower latency.In this paper,the BP decoding algorithm of 2×2 kernel polar codes is extended to 3×3 kernel polar codes.Firstly,the information update formula for the minimal computing unit within the 3×3 kernel is derived.Then,based on the information update formula,a 3×3 kernel BP decoding algorithm is given.Subsequently,based on this update formula,the BP decoding algorithm for the 3×3 kernel is presented.Simulation results indicate that,for 3×3 kernel polar codes,the BP decoding algorithm outperforms the SC decoding algorithm at medium to low signal-to-noise ratios.Moreover,under comparable decoding performance conditions,the BP decoding algorithm exhibits lower decoding latency.

关 键 词：极化码 置信传播译码算法 译码时延 译码性能 

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