基于简化序列重复节点的极化码快速串行抵消译码算法  

Simplified sequence repetition nodes-based fast successive cancellation decoding algorithm for polar code

作　　者：郭锐[1] 刘洋[1] GUO Rui;LIU Yang(School of Communication Engineering,Hangzhou Dianzi University,Hangzhou 310018,China)

机构地区：[1]杭州电子科技大学通信工程学院,浙江杭州310018

出　　处：《通信学报》2023年第5期158-168,共11页Journal on Communications

基　　金：浙江省重点研发计划基金资助项目(No.2023C03014)。

摘　　要：为了进一步降低串行抵消(SC)译码算法的译码时延,在序列重复(SR)节点的基础上,根据SR源节点的类型与译码复杂度,对不同类型的拓展类广义奇偶校验(EG-PC)节点进行分解、合并和简化,并使用快速简化串行抵消(Fast-SSC)译码对Rate-C节点进行裁剪处理,提出了基于简化SR节点的极化码快速SC译码算法(SSRFSC)。实验数据表明,在相近的译码性能下(在误帧率为10^(-3)时,约有0.1 dB的性能损失),与基于SR节点的快速SC(SRFSC)译码算法相比,所提算法的译码时延最多减少了28%;与Fast-SSC译码算法相比,译码时延最多减少了49%。In order to reduce the decoding latency of the successive cancellation(SC)decoding algorithm further,a kind of fast SC decoding algorithm based on simplified sequence repetition(SR)nodes,namely simplified sequence repetition node-based fast SC(SSRFSC),was proposed to optimize decoding latency issues of SC decoding algorithm.Different types of extended class of generalized parity-check(EG-PC)nodes were decomposed,merged and simplified based on the type of SR source node and decoding complexity,and Rate-C node was trimmed using fast simplified successive cancellation(Fast-SSC)decoding.Experimental results show that the decoding latency of the proposed algorithm can be reduced by up to 28%compared to the latest simplified sequence repetition(SRFSC)decoding algorithm when achieving similar decoding performance(approximately 0.1dB performance loss at frame error rate of 10^(-3)).Moreover,compared to the Fast-SSC decoding algorithm,the decoding latency of proposed algorithm can be reduced by up to 49%.

关 键 词：极化码 快速简化串行抵消 简化序列重复节点 译码时延 

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