Turbo码译码算法分析与研究  

Research and Analysis of Turbo-code Decoding

作　　者：崔中普 高俊[1] 窦高奇[1] 

机构地区：[1]海军工程大学电子工程学院,湖北武汉430033

出　　处：《通信技术》2016年第9期1144-1148,共5页Communications Technology

基　　金：湖北省自然科学基金(No.2015CFB174)~~

摘　　要：Turbo码具有接近shannon限的性能而受到广泛关注。在分析Turbo码编译码原理的基础上,重点对Turbo码两类译码算法——log-MAP算法与SOVA算法的性能和复杂度进行分析和比较。分析不同迭代次数、译码算法、帧长等对不同译码算法性能的影响,同时仿真分析不同参数对系统性能的影响,并从性能和复杂度两个方面分析两类算法的优缺点,以期为以后Turbo码译码的算法选择和参数设计提供指导。Turbo code, for its near Shannon limit performance, attracts widespread attennon. Baseu on analysis of Turbo-code encoding and decoding theory, the performance and complexity of the two Turbocode decoding algorithms, that is, MAP algorithm and SOVA algorithm, are emphatically analyzed and compared. The analysis involves the influences of iterations number, decoding algorithm and frame length on the performance of different decoding algorithms. In addition, the influences of different parameters on the system performance are simulated, and the advantages and disadvantages of the two algorithms also analyzed from two aspects of performance and complexity, thus providing a theoretical guidance for selection and parameters design of Turbo-code decoding algorithm in the future.

关 键 词：TURBO码 译码算法 LOG-MAP SOVA 复杂度 

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