一种基于折线逼近操作的极化码译码算法  

Decoding algorithm for polar codes based on polyline approximation operation

作　　者：马秋然 高宏峰 Ma Qiuran;Gao Hongfeng(School of Information Engineering,Henan University of Science&Technology,Luoyang Henan 471023,China)

机构地区：[1]河南科技大学信息工程学院,河南洛阳471023

出　　处：《计算机应用研究》2020年第7期2045-2048,2053,共5页Application Research of Computers

摘　　要：在加性高斯白噪声(additive white Gaussian noise,AWGN)信道下极化码的串行抵消(successive cancellation,SC)译码方法计算是在对数似然比(log likelihood ratio,LLR)域进行的,f函数节点的计算采用基于双曲正切规则的和积算法。针对双曲正切函数和反双曲正切函数提出了折线逼近算法,将这两个函数分别简化为9段折线函数;为了得到折线逼近算法下更优异的误帧率性能,编码前在信息比特中添加了16位CRC。仿真结果表明,针对码长为N=1024、信息位长度为K=496的极化码,提出的改进算法比和积算法有更好的误帧率性能且降低了译码复杂度,提高了译码速度。The successive cancellation(SC)decoding method for polar codes under additive white Gaussian noise(AWGN)channels is performed in the log-likelihood ratio(LLR)domain.The calculation of the f function nodes use a sum-product algorithm based on hyperbolic tangent rules.This paper proposed a polyline approximation algorithm,which simplified the hyperbolic tangent function and the inverse hyperbolic tangent function into a 9-segment polyline function respectively.In order to obtain better FER performance under the polyline approximation algorithm,this algorithm added a 16 bit CRC to the information bits before encoding.Simulation experiments show that for the polar codes with code length N=1024 and information bit length K=496,the proposed algorithm has better FER performance than the sum-product algorithm,and it reduces the decoding complexity and improves the decoding speed.

关 键 词：极化码 SC译码 和积算法 折线逼近算法 误帧率 

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