针对Turbo译码这类特殊的多阶段决策问题,即每阶段的决策总数和状态总数相等,评述了其4种算法的优劣性;设计了一种新的动态规划算法,编制了算法程序,应用于Turbo译码中。结果显示,该算法的误码率性能相对提高了28%,并与传统Turbo译码算法进行比较,运算时间只有原来的1/21,较好地避免了传统的Turbo译码算法需要进行指数运算,以及其随着迭代次数的增加容易数据溢出的问题。
The algorithm of dynamic programming and Turbo decoding were summarized in this paper,for such a special problem in multi-stage decision-making of Turbo decoding,which is the number of decision if equals to the the number of state in each stage of this problem,the four types of algorithms are reviewd.A new alggorithm of dynamic programming was been designed and been used in Turbo decoding by developed procedures the results showed that the performance of algorithm if reative inceeased by 28 percent,the computation time is only 1/21 compared with the algorithm of traditional Turbo decoding,but also(avoid) data overflow caused by exponential operation and itaerative operation with more times in traditional turbo decoding.So the method given in tjis paper is effective for decoding turbo code.