期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

低密度奇偶校验码的girth集及其性能分析 被引量：1

Girth Collection and Performance Analysis for Low-Density Parity-Check codes
在线阅读 下载PDF
导出
摘要 girth性质研究已经成为当前LDPC码的研究重点之一,本文在找到一种基于递归的LDPC码girth搜索方法的基础上,提出LDPC码的girth长度与纠错性能之间没有必然关系,并通过IEEE Std 802.16e格式的LDPC码进行了仿真验证;此外.本文指出,girth集影响LDPC码的纠错性能,在girth长度、码长等其他参数相同的情况下,纠错能力随girth集的变小而增强。 Study on properties of girth for LDPC code has become a hotspot nowadays,this article gives a new method for searching girth of LDPC code, and it presents the opinion that there is no certain relations between the length of girth and error correction performance of LDPC code ,which is verified by the LDPC code defined by IEEE Std 802.16e. Besides ,this article points out that error correction capabilities is influenced by girth collection, and it will increase with the decreasing of girth collection size when lengths of girth and codeword are equal.
作者 姚春光 郭秀英 张健 王建新
机构地区 国防科技大学电子科学与工程学院 石家庄铁道学院数理系 中国电子设备系统工程总公司
出处 《信号处理》 CSCD 北大核心 2007年第6期946-950,共5页 Journal of Signal Processing
关键词 LDPC码 giah girth集 IEEE STD 802.16e LDPC code girth girth collection IEEE STD 802.16e
分类号 TN911.22 [电子电信—通信与信息系统] TP393.092 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献16

  • 1GALLAGER R G. Low-density parity-check codes[J]. IRE Transactions on Information Theory. 1962,8( 1 ) :21-28.
  • 2MACKAY D J C, NEAL R M. Near Shannon limit performance of low-density parity-check codes [ J ]. Electronics Letters. 1996,32 ( 18 ): 1645-1646.
  • 3James A. McGowan and Williamson. Removing Loops from LDPC Codes. Australian Communication Theory Workshop Proceedings 2003.
  • 4卢开澄等.图论及其应用[M].北京:清华大学出版社.1995.
  • 5MAO Yong-yi, BANIHASHEMI A H. A heuristic search for good low-density parity-check codes at short block lengths [A]. IEEE International Conference on Communications [C]. Helsinki,Finland,2001.41-44.
  • 6O' Sullivan, M. , Brevik, J. , Wolski, R. , The Performance of LDPC codes with Large Girth, Proc. 43rd Allerton Conference on Communication, Control and Computing, Univ. Illinois,2005.
  • 7何善宝,赵春明,史志华,姜明.基于稀疏二进制序列的低密度奇偶校验码[J].通信学报,2005,26(6):81-86. 被引量：13
  • 8CAMPELL O, MODHA D S, RAJAGOPALAN S. Designing LDPC codes using bit-filling[A]. IEEE International Conference on Communications [ C ]. 2001.155-159.
  • 9IEEE Std 802.16e. Air Interface for Fixed and Mobile Broadband Wireless Access Systems(S).
  • 10HU Xiao-yu. Progressive edge-growth tanner graphs [ A ]. IEEE Global Telecommunications Conference [C]. 2001, San Antonio,TX,USA,2001. 995-1001.

二级参考文献22

  • 1何善宝,赵春明,姜明.LDPC码的一种循环差集构造方法[J].通信学报,2004,25(11):112-118. 被引量：11
  • 2刘玉君.信道编码[M].郑州：河南科学技术出版社,2001.9.
  • 3卢开澄.图论及其应用[M].北京：清华大学出版社,1995..
  • 4GALLAGER R G. Low-density parity-check codes[J]. IRE Transactions on Information Theory, 1962, 8(1): 21-28.
  • 5GALLAGER R G. Low-Density Parity-Check Codes [D]. Cambridge,MA: MIT Press, 1963.
  • 6MACKAY D J C, NEAL R M. Near Shannon limit performance of low-density parity-check codes [J]. Electronics Letters, 1996, 32 (18):1645-1646.
  • 7SIPSER M, SPIELMAN D.Expander codes [J]. IEEE Transactions on Information Theory, 1996, 42(6): 1710-1722.
  • 8WIBERG N. Codes and Decoding on General Graphs[D]. Linkoping University, Linkoping, Sweden, 1996.
  • 9MACKAY D J C. Good error-correcting codes based on very sparse matrices [J]. IEEE Trans Information Theory, 1999, 45 (2): 399-431.
  • 10HU Xiao-yu, ELEFTHERIOU E, ARNOLD D M. Progressive edge-growth tanner graphs [A]. IEEE Global Telecommunications Conference [C].2001, San Antonio, TX, USA, 2001. 995-1001.

共引文献17

同被引文献12

  • 1R. G. Gallager. "Low Density Parity Check Codes" [ M ]. Cambridge : MIT Press, 1963.
  • 2D. J. C. MacKay, R. M. Neal. "Near Shannon Limit Performance of Lo Density Parity Check Codes" [ J ]. Electronics Letters, 1997,32 ( 18 ) : 1645-1 646.
  • 3Jos M. F. Morua, J, Lun and Haotian Zhang," Structured Low-Density Parity-Check Codes" IEEE Signal Processing Magazie ,January 2004.
  • 4Y. Kou, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: A rediscovery and new results, "IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
  • 5D. Divsalar, H. Jin, and R. McEliece, " Coding theorems for turbo-like codes, "in Proc. 36th Allerton Conf. Communications, Control and Computing, Urbana, IL, Sep. 1998.
  • 6J. Fan," Array codes as low-density parity check codes," in Proc. 2nd Int. Syrup. Turbo Codes and Related Topics, Brest, France, Sep. 2000, pp. 543-546.
  • 7B. Vasic, O. Milenkovic, " Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding," IEEE Trans on IT, Vol. 50, No. 6, pp: 1156-1176, June 2004.
  • 8I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett. ,vol. 7 ,no. 7 ,pp. 317-319 ,Jul. 2003.
  • 9Zongwang Li, et. al. , Efficient Encoding of Quasi-Cyclic Low-Density Parity-Check Codes, IEEE Trans. on Com. , Vol. 54, No. 1, January 2006.
  • 10L. Lan, L. -Q. Zeng, Y. Y. Tai, S. Lin and K. Abdel-Ghaf- far," Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings, "Proc. IEEE Int. Symp. Inform. Theory, Adelaide, Australia, Sep. 4-9,2005.

引证文献1

二级引证文献1

信号处理
2007年 第6期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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