期刊文献+

非二进制RS-Turbo级联码性能研究 被引量:2

Study on Performance of Non-binary RS-Turbo Concatenated Codes
下载PDF
导出
摘要 介绍了非二进制Turbo码的编码器结构,详细分析了逐符号对数MAP译码算法。在此基础上,设计了一种RS-Turbo级联码方案,该方案包括一个RS(255,239,8)外码和一个非二进制Turbo内码。仿真结果表明,与单纯使用非二进制Turbo码相比,本文提出的级联方案可明显改善高信噪比情况下的BER性能,同时可降低迭代次数。另外,级联RS码可为Turbo迭代译码提供简单可行的停止准则。 The encoder structure of non-binary Turbo code is presented and the symbol-by-symbol log- MAP decoding algorithm is analyzed in detail. A new scheme of RS-Turbo concatenated codes is designed which consists of an RS (255,239,8) outer code followed by a non-binary Turbo inner code. The simulation results show that the proposed concatenated scheme can significantly improve the BER performance at high SNR and reduce the iteration number compared to non-binary Turbo code. Furthermore, the concatenated RS code can supply a simple stopping criterion for turbo iterative decoding.
作者 侯铭睿 史萍
出处 《中国传媒大学学报(自然科学版)》 2008年第1期64-68,74,共6页 Journal of Communication University of China:Science and Technology
基金 亚洲传媒研究中心重大项目(AM0501)
关键词 非二进制Turbo码 RS-Turbo级联码 逐符号对数MAP算法 停止准则 迭代译码 错误平层 non-binary Turbo code RS-Turbo concatenated codes symbol-by-symbol log-MAP algorithm stopping criterion iterative decoding error floor
  • 相关文献

同被引文献18

  • 1Shannon C E.A Mathematical Theory of Communication[J].Bell System Teeh J,1950,29:147-160.
  • 2R udiger Urbanke.Modem Coding Thoery[M].Cambridge:Cambridge University Press,2008.
  • 3Berrou C,Glavieux A,Thitimajshima P.Near Shannon limit error-correcting coding and decoding:turbo-codes[C].In Proc of ICC,Geneva,1993,1064-1070.
  • 4D J C Mackay.Good Error-Correcting Codes Based on Very Sparse Matrices[J].IEEE Trans info Theory,1999,45 (2):399-431.
  • 5R G Gallager.Low-Density Parity-Check Codes[J].IRE Transactions on Information Theory,1962,8:21-28.
  • 6Sac-Young Chung,G.David Forney,Thomas J.Richardson.On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit[J].IEEE Comm Letters,2001,5(2):58-60.
  • 7Gallager R G.Low-Density Parity Check Codes[M].Cambridge,M A:M I T Press,1963.
  • 8Xiao-Yu Hu,Evangelos Eleftheriou,DieterMichael Arnold.Regular and irregular progressive edge-growth Tanner graphs[C].Global Telecommunications Conference,2001:995-1001.
  • 9Tanner R M,Sridharan D,etal.LDPC Block and Convolutional Codes Based on Circulant Matrices[J].IEEE Trans Inform Theory,2004,50(12):2966-2984.
  • 10Fossorier M.Quasi-Cyclic Low-Density Parity-Check Codes From Circulant Permutation Matrices[J].IEEE Transactions on Information Theory,2004,50(8).

引证文献2

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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