低复杂度Log-MAP译码算法的研究  

Research on low-complexity algorithm for Log-MAP decoding

作　　者：毕岗[1,2] 王建毅[1] 

机构地区：[1]浙江大学信息与电子工程学系,杭州310027 [2]浙江大学城市学院信息与电气工程分院,杭州310015

出　　处：《计算机工程与应用》2011年第10期89-91,97,共4页Computer Engineering and Applications

基　　金：浙江省自然科学基金No.Y107435~~

摘　　要：提出用插值函数来计算Log-MAP算法中的校正函数,并在AWGN信道上采用分段差值方法实现了Turbo译码。该算法解决了校正函数计算复杂度较大的问题,消除了译码计算中的指数和对数运算。仿真结果表明:用2段二次样条函数实现的Turbo译码器,其译码性能与Log-MAP算法等价,而计算的复杂度明显降低,运算时间大幅度减少。This paper proposes an approximate calculation for correction function of Log-MAP algorithm and obtaines a well turbo decoding in AWGN channel.The algorithm mainly uses segmenting and fitting method for correction function by spline function.The kind of the method has solved the difficulties and obstacles resulting from inaccessible calculation of correction function with exponential and logarithm operations.It shows that error correction performance of turbo decoder with the interpolation function calculating correction function is the same as that with Log-MAP algorithm,and the former algorithm complexity is much obviously lower than the latter.

关 键 词：TURBO码 MAP算法 二次样条函数 HERMITE插值 

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