论文部分内容阅读
在文章中,首先介绍Turbo码的基本编译码结构和它的译码算法MAP。在此基础上,尝试对MAP算法的循环译码的后向递推的起点以及循环译码结构的最终判决条件根据实际应用情况进行改进。将译码的后向递推的起点定义为译码的前向递推的终点,并且将每一轮译码结果进行加权相加,得到最后系统输出。最后,根据MATLAB仿真的结果论证改进后的算法能减少系统的误码率。
In the article, we introduce the basic structure of Turbo code and its decoding algorithm MAP. On the basis of this, attempts are made to improve the starting point of backward recursion of cyclic decoding of MAP algorithm and the final decision condition of cyclic decoding structure according to the actual application. The starting point of decoding backward recursion is defined as the end point of forward recursion of decoding, and the result of each round of decoding is weighted added to obtain the final system output. Finally, the results of MATLAB simulation demonstrate that the improved algorithm can reduce the BER of the system.