摘要
通过对 Tubro码最大似然译码 MAP算法 (maximum posteriori probability algorithm)和 SOVA算法 (softoutput viterbi algorithm)的比较和对 SOVA算法的比较深入的分析 ,对 Turbo码在译码过程中存在的时延较大的问题做出了一些改进 ,并且针对引起时延的不同原因讨论了具体的解决方案 .通过 Matlab进行仿真 ,表明这些改进是有意义的 .
Through a comparison of the MAP and SOVA algorithms of the Turbo code and an analysis on the SOVA algorithm, some improvements upon its time delay in Turbo code decoding were arrived at and measures for solving the problem were discussed. Through computer simulation, the paper presents some useful conclusions. Simulation results show that the improvements are effective.
出处
《北京理工大学学报》
EI
CAS
CSCD
北大核心
2003年第1期105-108,共4页
Transactions of Beijing Institute of Technology
基金
国防科工委"十五"预研项目 ( 0 10 0 0 0 0 410 0 10 30 2 2 )
