基于Cyclic-2伪最大似然算法的Turbo乘积码在高速移动通信系统中的译码方法  

Decoding Method of Turbo Product Codes Based on Cyclic-2 Pseudo Maximum Likelihood Algorithm in High-speed Mobile Communication Systems

作　　者：陈超[1] 罗汉文[1] 徐友云[1] 张乐[1] 

机构地区：[1]上海交通大学电子工程系,上海200030

出　　处：《电讯技术》2005年第1期67-71,共5页Telecommunication Engineering

基　　金：国家自然科学基金资助项目(60272079);国家自然科学基金重点项目 (60332030);国家高科技研究发展计划(863计划)重大专项项目(2003AA123310)

摘　　要：采用扩展汉明码作为Turbo乘积码 (TPC)的子码时,与传统的Chase算法相比,Cyclic-2PML(循环 2伪最大似然)算法复杂度低。本文研究了基于该算法的TPC在高速移动通信系统中的译码方法,仿真比较了采用不同子码组合的TPC结合不同的调制方式在高斯信道和多径衰落信道中的性能。结果表明,以(32, 26, 4)扩展汉明码为子码的TPC,不仅具有较高的码率,同时可以获得更好的误比特率性能。Cyclic-2 PML (Pseudo Maximum Likelihood) algorithm is of lower complexity compared with the traditional Chase algorithm when extended hamming code is used as the sub-code of Turbo Product Code(TPC). Based on Cyclic-2 PML algorithm, this paper studies the decoding of TPC in high-speed mobile communication systems, and the performance of TPC with different sub-codes and different modulation types are given for the Additive White Gaussian Noise (AWGN) and multipath fading channels. Simulation results show that TPC with (32,26,4) extended hamming code as sub-code can achieve better Bit Error Rate (BER) with a higher code rate.

关 键 词：移动通信系统 TURBO乘积码 软输入软输出译码 迭代译码 循环2伪最大似然算法 

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