期刊文献+

一种适用于T-TCM系统的简化的Log-Map算法

A Simplified Log-MAP Algorithm for T-TCM Decoding
下载PDF
导出
摘要 本文提出了一种适用于Turbo网格编码调制(T-TCM)系统的简化Log-MAP算法,它可以轻松在硬件实现。我们探索了一种新的分段函数代替Log-MAP算法中的雅克比对数校正项,用这个方法可以损失很小的性能增益去简化Log-MAP算法。仿真结果证明我们的方法可以用非常低的复杂度实现和Log-MAP算法几乎相同的性能。此外,与S.Talakoub等人提出的improved MAX-Log-MAP算法相比,我们的算法降低了大约39%的复杂度,并且完全没有性能损失。 A simplified decoding algorithm for turbo trellis-coded modulation ( T-TCM) is proposed, which is easy to implement in hardware. The algorithm exploits a new piece-wise function to replace the logarithmic term of the Jacobian logarithm based on the MacLaurin Series. Simulation results show that the proposed algorithm can archive log-MAP-similar decoding performance with a much lower computa-tional complexity. It can reduce about 40% of calculation in contrast to the improved MAX-Log-MAP.
作者 王建 李建平
出处 《中国传媒大学学报(自然科学版)》 2014年第1期57-61,共5页 Journal of Communication University of China:Science and Technology
关键词 LOG-MAP算法 简化Log-MAP算法 TURBO译码 T-TCM Log-MAP T-TCM simplified Log-MAP Turbo decoding
  • 相关文献

参考文献1

二级参考文献5

  • 1晏裕春,蒋宇中,韩郁.低信噪比通信系统中Turbo码应用仿真[J].微计算机信息,2006,22(01S):238-239. 被引量:12
  • 2C.Berrou,A.Glavieux,P.Thitimajshima.Near Shannon limit error-correcting coding and decoding:Turbo-codes (1)[C].ICC,Switztland:Geneva,1993:1064-1070.
  • 3C.Berou,A.Glaxieux.Near optimum error correcting coding and decoding:Turbo-codes[J].IEEE Trans.on Comm,Oct.1996,44(10):1261-1271.
  • 4V.Franz,J.B.Anderson.Concatenated decoding with a reduced-search BCJR algorithm[J].Selected Areas in Communications,IEEE Journal 1998,16(2):186-195.
  • 5P.Robertson,E.Villebrun,P.Hoeher.A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain[C].Proceedings of ICC'95,Seattle:IEEE,1995:1009-1013.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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