期刊文献+

非系统Turbo码

下载PDF
导出
摘要 本文分析了非系统Turbo码的特性,从错误平层角度上看,非系统Turbo码有效自由距离属性使它比系统Turbo码取得更低的错误平层。本文还设计了一种新型的非系统Tuebo码的编译码器,并对相应的等价的非系统Turbo码与系统Turbo码的性能进行了比较。
作者 林开
出处 《科技资讯》 2006年第30期3-4,共2页 Science & Technology Information
  • 相关文献

参考文献3

二级参考文献20

  • 1[1]BAHL L R, COCKE J, JELINEK F,et al.Optimal decoding of linear codes for minimizing symbol error rate[J]. IEEE Transactions on Information Theory, 1974, 284-286.
  • 2[2]BERROU C,GLAVIEUX A. Near optimum error correcting coding and decoding: Turbo Codes[C]. In Proc IEEE International Conference on Communication (ICC), Geneva, Switzerland, 1993,1064-1070.
  • 3[3]JUNG P,NAPHAN M M. Comprehensive comparison of turbo-code decoders [C]. In IEEE Vehicular Technology Conference,Chicago, USA, 1995,624-628.
  • 4[4]ROBERTSON P. Improving decoder and code structure parallel concatenated recursive systematic (turbo) codes[C]. In IEEE International Conference on Universal Personal Communications. San Diego, USA,1994,183-187.
  • 5[1]C Berrou, A Glavieux, P Thitimajshima. Near Shannon limit error-correcting coding and decoding: Turbo-codes [A] .In Proc. IEEE Int. Conf on Commun,Geneva[C] . Switzerland:1993,1064 - 1070.
  • 6[2]M Cedervall, R Johannesson. A fast algorithm for computing distance spectrum of convolutional codes [J]. IEEE Trans.Inform. Theory, 1989,35 (6): 1146 - 1159.
  • 7[3]L R Bahl,J Cocke, F Jelinek,J Raviv. Optimal decoding of linear codes for minimizing symbol error rate[J] . IEEE Trans.Inform. Theory, 1974,20: 284 - 287.
  • 8[4]J Hagenauer, E Offer, L Papke. Iterative decoding of binary block and convolutional codes[J].IEEE Trans. Inform. Theory, 1996,42: 429 - 445.
  • 9[5]S Benedetto, G Montorsi. Unveiling Turbo codes: some results on parallel concatenated coding schemes [J]. IEEE Trans.Inform. Tbeory, 1996,42:409 - 428.
  • 10[6]L C Perez, J Seghers, D J Costello Jr.A distance spectrum interpretation of Turbo codes[J] . IEEE Trans. Inform. Theory, 1996,42:1698 - 1709.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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