基于SPA算法的Turbo码译码  

Decoding Turbo Codes Based on SPA Algorithm

作　　者：叶春燚[1] 李晓毅[1] 向平[2] 高红杰[2] 

机构地区：[1]重庆通信学院,重庆400035 [2]重庆大学,重庆400030

出　　处：《重庆工学院学报（自然科学版）》2008年第8期166-168,共3页Journal of Chongqing Institute of Technology

摘　　要：通过把Turbo码当作一种串行级联码进行处理,在改进编码框图和降低奇偶校验矩阵后,得到了一种改进的Turbo码.采用和积算法译码进行仿真,结果显示,该方法降低了译码的复杂度.Turbo Codes are studied as serially concatenated cedes in this paper. To change the structure of the turbo coder and decrease the density of the parity-check matrices of the codes, a novel turbo code is obtained. The simulation of these cqdes using sum-product algorithm show that the complexity of encoding is decreased.

关 键 词：TURBO码 SPA算法 仿真 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]