期刊文献+

基于不同外信息处理方式的Turbo迭代译码研究 被引量:4

Study on Iterative Decoding of Turbo Codes with Extrinsic Information in Different Versions
下载PDF
导出
摘要 针对离散无记忆高斯信道,该文深入剖析了不同外信息使用方式下的两种对数域的Turbo码迭代译码算法,并借助蒙特卡罗仿真,在相同的约束条件下对两种算法的性能进行了比较。经过分析指出二者在本质上是一致的,只是成员译码器对外信息使用权重的处理不同。最后对其进行了统一的描述,并定量研究了迭代译码对外信息的依赖性。结果发现成员译码器对外信息的最佳依赖程度不受信噪比与迭代次数的影响。 In this paper, based on various methods of using extrinsic information, two logarithmic iterative decoding algorithms of Turbo codes are anatomized clearly for a discrete memoryless Gaussian channel. With Monte Carlo simulation, performance of two algorithms is compared under the same constraint condition; after analysis it is proposed that they are identical in nature, the only difference is how to deal with scale of extrinsic information for component decoder to use. Finally, a united form is used to describe two algorithms and some research is done for the dependency on extrinsic information in iterative decoding numerically, from the result it is found that SNR and iterative number do not affect the best scale of extrinsic information used in component decoder.
出处 《电子与信息学报》 EI CSCD 北大核心 2005年第10期1643-1646,共4页 Journal of Electronics & Information Technology
基金 国家部级基金资助项课题
关键词 TURBO码 LOG-MAP译码算法 迭代译码 外信息 Turbo codes, Log-MAP decoding algorithm, Iterative decoding, Extrinsic information
  • 相关文献

参考文献8

  • 1Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit error-correcting coding and decoding: Turbo-codes[C]. IEEE International Conference on Communication, Geneva, Switzerland, May 1993:1064 - 1070.
  • 2Robertson P. Illuminating the structure of code and decoder of parallel concatenated recursive systematic (turbo) codes[C]. Proc.IEEE Global Commun. Conf. (GLOBECOM'94),San Franci-sco,CA, 1994: 1298- 1303.
  • 3Colavolpe G, Ferrari G, Raheli R. Extrinsic information in iterative decoding: a unified view[J]. IEEE Trans on Communications, 2001, 49(12): 2088 - 2094.
  • 4Bahl L R, Cocke J, Jelinek F, Raviv R. Optimal decoding of line-ar codes for minimizing symbol error rate[J]. IEEE Trans.Info. Theory, 1974, 20(2): 284 - 284.
  • 5Robertson P, Hoeher P, Villebrum E. Optimal and sub-optimal maximum a posteriori algorithms suitable for turbo decoding[J].European Trans. on Telecomm, 1997, 8(2): 119- 125.
  • 6Benedetto S, Divsalar D, Montorsi G. Pollara F. Soft-output decoding algorithms in iterative decoding of turbo codes[A]. JPL TDA Progress Report, Feb. 15, 1996:42 - 127.
  • 7Hagenauer J, Offer E, Papke L. Iterative decoding of block and convolutional codes[J]. IEEE Trans. on Info Theory, 1996,42(2): 429 - 445.
  • 8Berrou C, Glavieux A. Near optimum error correcting coding and decoding: Turbo-codes[J]. IEEE Trans. on Communications, 1996,44(10): 1261 - 1271.

同被引文献23

  • 1姚如贵,王永生,徐娟.Ricean信道下Turbo码性能研究[J].通信学报,2005,26(6):1-5. 被引量:2
  • 2袁剑锋,王伟.Turbo解码的算法改进及其定点仿真[J].计算机仿真,2005,22(8):91-94. 被引量:1
  • 3董振飞.Turbo码的性能分析及其应用[J].现代电子技术,2006,29(4):42-44. 被引量:2
  • 4韩志学,毕文斌,张兴周.一种提高SCCPM系统迭代检测收敛性的方法[J].电子与信息学报,2007,29(2):274-277. 被引量:7
  • 5Rohertson P,Worz T.Coded modulation scheme employing turho codes[J].Electronics Letters, 1995,31 ( 18 ) : 1546-1547.
  • 6Robertson P,Worz T.A novel bandwidth efficient coding scheme employing turbo codes[C]//Proc IEEE International Conference on Communications, Dallas, Texas, USA, 1996: 962-967.
  • 7Robertson P,Worz T.Bandwidth-efficient turbo trellis-coded modulation using punctured component codes[J].IEEE Journal on Selected Areas in Communications, 1998, 16(2) : 206-218.
  • 8Hagenauer J,Offer E,Papke L.herative decoding of block and convolutional codes[J].IEEE Transactions on Information Theory, 1996,42(2) : 429-445.
  • 9Robertson P,Villebrun E,Hoeher P.A comparison of optimal and sub-optimal MAP decoding algorithms operating in the log domain [C]//Proc ICC '95 ,Seattle, USA, 1995 : 1009-1013.
  • 10Takeshita O Y,Costello D J.On deterministic linear interleavers for Turbo codes[C]//the 35th Annual Allerton Conference on Communication, Control and Computing, Illinois, USA, 1997 : 711-712.

引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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