期刊文献+

低密度校验码的研究进展 被引量:4

Survey of Research on Low Density Parity Check Codes
下载PDF
导出
摘要 本文对低密度校验(LDPC)码的奇偶校验矩阵的构造方法和编译码方法进行了分析和总结,对LDPC码的应用及未来的研究方向进行了展望。 This paper gives a comprehensive survey on the methods of construction of parity check matrix and encoding and decoding of LDPC, and discusses applications and future researches on LDPC codes.
机构地区 北京邮电大学
出处 《电信科学》 北大核心 2005年第5期48-51,共4页 Telecommunications Science
基金 国家自然科学基金资助项目(No.60272052) 国家"863"计划资助项目(No.2001AA123016)48
关键词 低密度校验码 奇偶校验矩阵 信道编码 LDPC TANNER图 LDPC code, iterative decoding, message iterative decoding algorithm
  • 相关文献

参考文献12

  • 1Shannon C E. A mathematical theory of communications. Bell Syst Tech J, 1948, 27(7,10): 379-423, 623-656
  • 2Shannon C E. Communication in the presence of noise. In: Proc IRE,1949
  • 3Berrou C, Glavieux A, Thitimajshima P. Near Shannon limit Error-correcting coding and decoding. In: Proc ICC'93, Geneva, Switherland,May 1993
  • 4Gallager R G. Low density parity check codes. IRE Trans Info Theory,1962 (IT-8) :21~28
  • 5David M. Good error-correcting codes based on very sparse matrices.IEEE Trans on Information Theory, 1999, 45(2): 399~431
  • 6Hu Xiao-Yu, Eleftheriou Evangelos, Arnorld Dieter-Michael. Progress edge-growth Tanner graphs. In: Proceedings of Globecom2001, San Antonio, Nov 2001
  • 7Hu Xiao-Yu, Evangelos Eleftheriou, Arnold D M. Regular and irregular progressive edge-growth Tanner graph. IEEE Trans on Information Theory, 2005, 51(1)
  • 8Kou Y, Lin S, Fossorier M. Low density parity check codes based on finite geometries: a rediscovery and new results. IEEE Trans Information Theory, 2001, 47(10): 2711~2736
  • 9Zhang J, Fossorier M P C. A modified weighted bit-flipping decoding of low-density parity-check codes. IEEE Communications Letters, 2004, 8(3): 165~167
  • 10Guo F, Hanzo L. Reliability ratio based weighted bit-flipping decoding for low-density parity-check codes. IEE Electronics Letters, 40 (21):1356~1358

同被引文献13

引证文献4

二级引证文献7

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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