一种Turbo码译码的矩阵算法  

A MATRIX DECODING ALGORITHM FOR TURBO-CODES

作　　者：张忠培[1] 周亮[2] 

机构地区：[1]清华大学微波与数字通信国家重点实验室,北京100084 [2]电子科技大学国防通信抗干扰实验室,成都610054

出　　处：《电子与信息学报》2002年第2期266-271,共6页Journal of Electronics & Information Technology

基　　金：中兴通讯研究基金

摘　　要：在Bahl矩阵算法的基础上,提出了Turbo码译码的矩阵算法,使Turbo码的复杂迭代运算简化为适用于大规模集成电路的矩阵运算,运算速度得以提高,数据存量变小,译码过程简单明了,特别适用于约束长度较小的Turbo码译码。讨论了第三代移动通Turbo编码的状态转移图及矩阵译码过程。A new matrix decoding algorithm for Turbo-codes is derived from Bahl's matrix algorithm. The complex iterating operations are paralleled and well formulclted as a set of simple matrix operations which are fit to design efficient VLSI circuits. Thus, the matrix algorithm increases the decoding speed and simplifies the excessive memory accesses, and is specially fit to Turbo-codes with small memories. States transfer and decoding process of Turbo-codes in 3GPP are also discussed in this paper.

关 键 词：MAP算法 TURBO码 迭代译码 矩阵算法 

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