Turbo译码中的Log-MAP折线逼近法  

Folded linear approach method for Log-MAP Turbo decoding

作　　者：赵旦峰[1] 张英 陶磊岩[1] 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,哈尔滨150001

出　　处：《吉林大学学报（工学版）》2009年第5期1364-1368,共5页Journal of Jilin University:Engineering and Technology Edition

基　　金：黑龙江省自然科学基金项目(F200503)

摘　　要：为了在降低Turbo系统译码延时的同时仍保证其优良的低误比特率性能,本文提出折线逼近法方案。该方案只用比较器和加减法,就能在保证Turbo码低误比特率的前提下,有效降低系统延时和译码复杂度。仿真结果表明:折线逼近法的译码性能大大优于Max-Log-MAP方法,同时比二次幂逼近算法降低1.5倍以上的系统延时。A method named folded linear approaching is proposed to reduce the delay of Turbo decoder system, meanwhile, still ensures excellent low bit rates. This approach is able to maintain fast system operation and good decoding capability by only using competitors and adders. Simulation results show that the decoding performance of the method is much better than that of Max-Log-MAP, and can reduce systematical delay by 1.5 times than the square method.

关 键 词：通信技术 纠错编码 折线逼近法 Log—MAP TURBO码 

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