| Turbo码的一种高效改进型MAP译码算法 |
| |
| 引用本文： | 赵宏宇, 范平志. Turbo码的一种高效改进型MAP译码算法[J]. 电子与信息学报, 2008, 30(10): 2397-2401. doi: 10.3724/SP.J.1146.2007.00390 |
| |
| 作者姓名： | 赵宏宇 范平志 |
| |
| 作者单位： | 西南交通大学移动通信研究所信息编码与传输省重点实验室 成都610031;西南交通大学移动通信研究所信息编码与传输省重点实验室 成都610031 |
| |
| 基金项目： | 国家自然科学基金，NSFC/RFBR研究项目 |
| |
| 摘 要： | 该文给出了一种改进型最大后验概率(MAP)译码算法用于实现并行级联卷积码(Turbo码)的最优译码。与基于对数域的Log-MAP算法相比较，该文给出的算法不引入对数域，但能够完全消除标准MAP算法在迭代过程中必须进行的大量指数和对数运算。计算机仿真结果表明，这种具有最优纠错性能的改进型MAP算法能够显著减少运行时间，其译码效率甚至优于牺牲了较多纠错性能的最快速的对数域MAP译码算法(Max-Log-MAP)。
|
| 关 键 词： | Turbo码 最大后验概率译码 译码时延 |
| 收稿时间： | 2007-03-19 |
| 修稿时间： | 2007-08-22 |
An Efficient Improved MAP Decoding Algorithm for Turbo Codes |
| |
| Zhao Hong-Yu, Fan Ping-Zhi. An Efficient Improved MAP Decoding Algorithm for Turbo Codes[J]. Journal of Electronics & Information Technology, 2008, 30(10): 2397-2401. doi: 10.3724/SP.J.1146.2007.00390 |
| |
| Authors: | Zhao Hong-yu Fan Ping-zhi |
| |
| Affiliation: | Provincial Key Lab of Information Coding & Transmission, Institute of Mobile Communication, Southwest Jiaotong University, Chengdu 610031, China |
| |
| Abstract: | This paper presents an improved maximum a posteriori probability (MAP) decoding algorithm for optimal decoding of parallel concatenated convolutional codes (Turbo codes). Compared with the Log-MAP algorithms based on logarithm domain, the proposed algorithm does not introduce logarithm domain, but it can eliminate large amount of exponential and logarithm arithmetic operations required with the standard MAP algorithm in the iterative decoding process. Simulations demonstrate that he proposed algorithm, with optimal error correction performance, can significantly reduce the running time, such that its decoding efficiency is even slightly superior to that of the fastest logarithm domain MAP algorithm(Max-Log-MAP) which sacrifices considerable error correction performance. |
| |
| Keywords: | Turbo code MAP decoding Decoding delay |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《电子与信息学报》浏览原始摘要信息 |
|
点击此处可从《电子与信息学报》下载全文 |
