期刊文献+

关于Turbo码可实现解码方法的研究 被引量:1

Study of Practical Decoding Algorithm of Turbo Code
原文传递
导出
摘要 Turbo码解码算法包括SOVA(softoutputviterbialgorithm) ,MAP (maxaposterior) ,以及LOGMAP算法 .其中LOGMAP算法兼有高性能和低计算复杂度的优点 .为了降低解码复杂度 ,对LOGMAP算法进行了模拟优化 ;为进一步减少解码时间 ,在解码过程中引入了滑动窗技术 .并对整个Turbo码解码过程进行量化模拟 ,得出了优化结果 . Decoding algorithm of Turbo code includes SOVA, MAP and LOGMAP. LOGMAP algorithrn has good compromise between performance and complexity. In order to reduce decoding complexity, LOGMAP algorithms is simulated and optimized; and sliding window is applied to reduce decoding time further; then the whole decoding process is quantified for an optimal result.
出处 《复旦学报(自然科学版)》 CAS CSCD 北大核心 2001年第1期8-12,共5页 Journal of Fudan University:Natural Science
关键词 系统反馈卷积码 MAP算法 LOGMAP算法 滑动窗 TURBO码 解码方法 RSC MAP algorithm & LOGMAP algorithm sliding window
  • 相关文献

参考文献5

  • 1[1] Cover T, Thomas J. Elements of information theory[M]. New York : Wiley Interscience, 1991.
  • 2[2] Berrou C, Glavieux A, Thitimasjshima P. Near Shannon limit error-correcting coding and decoding: Turbo-codes(1)[A]. Proc IEEE Int Conf on Communications[C]. Geneva: Switzerland, 1993. 1064-1070.
  • 3[3] Benedetto S, Montorsi G. Unveilling turbo codes: Some results on parallel concatenated coding schemes[J]. IEEE Trans Inform Theory, 1996, 42 (2): 409-428.
  • 4[4] Bahl L, Cocke J, Jeinek F. Optimal decoding of linear codes for minimizing symbol error rate[J]. IEEE Trans Inform Theory, 1974, 20(2) : 248-287.
  • 5[5] Robertson P, Villebrun E, Hoeher P. A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain[A]. Proc IEEE Int Conf on Communications[C]. Seattle: WA, USA, 1995. 1009-1013.

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部