期刊文献+

Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC code 被引量:2

Ruling out small stopping sets and small girth in Tanner graph of QC-LDPC code
下载PDF
导出
摘要 The existing constructions of quasi-cyclic low-density parity-check (QC-LDPC) codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate (BER) performance of QC-LDPC codes being much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity-check matrix of QC-LDPC codes can effectively avoid specified stopping sets and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length. The existing constructions of quasi-cyclic low-density parity-check (QC-LDPC) codes do not consider the problems of small stopping sets and small girth together in the Tanner graph, while their existences will lead to the bit error rate (BER) performance of QC-LDPC codes being much poorer than that of randomly constructed LDPC codes even decoding failure. To solve the problem, some theorems of the specific chosen parity-check matrix of QC-LDPC codes without small stopping sets and small girth are proposed. A novel construction for QC-LDPC codes with long block lengths is presented by multiplying mmin or the multiple of mmin, which is the minimum order of the identity matrix for the chosen parity-check matrix. The simulation results show that the specific chosen parity-check matrix of QC-LDPC codes can effectively avoid specified stopping sets and small girth and exhibit excellent BER performance than random LDPC codes with the same longer codes length.
出处 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2010年第1期134-137,共4页 系统工程与电子技术(英文版)
基金 supported by the National Natural Science Foundation of China (60572093) Specialized Research Fund for the Doctoral Program of Higher Education (20050004016)
关键词 quasi-cyclic low-density parity-check codes stoppingset stopping distance GIRTH circulant matrices. quasi-cyclic low-density parity-check codes, stoppingset, stopping distance, girth, circulant matrices.
  • 相关文献

参考文献1

二级参考文献20

  • 1Gallager R G. Low-density parity-check codes[M]. Cambridge, MA: MIT Press, 1963. 被引量:1
  • 2Richardson T, Urbanke R. The capacity of low-density parity check codes under message passing decoding[J].IEEE Trans. on Inform. Theory, 2001, 47(2): 599-618. 被引量:1
  • 3Chung S Y, Forney G D, Richardson Jr T J, et al. On the design of low-density parity check codes within 0. 004 5 dB of the Shannonlimit[J]. IEEE Commun. Lett. , 2001, 5(2):58-60. 被引量:1
  • 4MacKay D J C, Wilson S T, Davey M C. Comparison of construetions of irregular Gallager codes[J]. IEEE Trans. on Corn munications, 1999,47(10) : 1449 - 1454. 被引量:1
  • 5Tanner R M, Sridhara D, Sridharan A, et al. LDPC block and convolutional codes based on circulant matrices[J]. IEEE Trans. on Information Theory, 2004, 50(12):2966-2984. 被引量:1
  • 6Seho Myung, Kyeongcheol Yang. A combining method of quasicyclic LDPC codes by the Chinese remainder theorem[J]. IEEE Communications Letters, 2005. 9(9) :823 - 825. 被引量:1
  • 7Lin Dengsheng, Li Qiang, Li Shaoqian. Semi-random construction of quasi-cyclic LDPC codes[C]//Proc. of International Conference on Communications, Circuits and Systems, 2005 ( 1 ) : 9 -13. 被引量:1
  • 8Kim Sunghwan, No Jong-Seon, Chung Habong, et al. Girth analysis of Tanner's (3,5) QC LDPC codes[C]//Proc, of Inter national Symposium on 1n formation Theory, 2005: 1632-1636. 被引量:1
  • 9Kou Y, Lin S, Fossorier M. Low density parity check codes based on finite geometries: a rediscovery and new results[J]. IEEE Trans. on Inform. Theory, 2001, 47(11):2711 - 2736. 被引量:1
  • 10IEEE Std 802.16e. Draft IEEE standard for local and metropol itan area networks, Part 16: Air interface for fixed and mobile broadband wireless access systems. 2006. 被引量:1

共引文献9

同被引文献42

  • 1郑秋容,袁乃昌,高强.遗传算法在非对称单脊波导缝隙天线设计中的应用[J].微波学报,2007,23(1):6-9. 被引量:2
  • 2BRUKIEWA T F, CHO C, JENABI M, et al. Development and test 9f an X/Ku band tile technology mihi-link antenna system for CDL communications [ C ]//Proc of IEEE Radar Conference. 2003 : 423- 428. 被引量:1
  • 3Office of force transformation: network centric warfare education home page [ EB/OL]. http ://www. oft. osd. rail/initiatives/stiletto/. 被引量:1
  • 4REINHARDT B. The tactical link: next generation C2P implements JRE and link-22 [ C ]//Proc of IEEE Military Communications Confe- rence. 2005:256- 269. 被引量:1
  • 5WODWARD R. The evolution of army aviation into network centric warfare using IDM technology [ C ]//Proc of IEEE American Helicop- ter Society 60th Annual Forum. Batimore: American Helicopter Soci- ety ,2004:352-361. 被引量:1
  • 6KIM J Y, KANG S, LEE N. Reliability assessment of translated VMF/Link- 16 messages [ J ]. IEEE Trans on Systems, 2008,36 (3) :283-284. 被引量:1
  • 7LEFEVER R, HARPER R C. Performance of high rate Link-22 ope- ration obtained by using quadrature amplitude modulation (QAM) [J]. IEEE Trans on Systems,1999,12(5) :979-983. 被引量:1
  • 8ELLEDGE A, ROBINSON B. Exchanging Link-16 cot messages and U.S. army abcs messages via pass[J]. IEEE Trans on Systems, 2007,42(7) : 1513-1518. 被引量:1
  • 9BERROU C, GLALAVIEUX A, THITIMAJSHIMA P. Near Shannon limit error-correcting coding and decoding: turbo codes [ C ]//Proc of IEEE Information Conference on Communications. 1993:1064-1070. 被引量:1
  • 10BERROU C, GLALAVIEUX A. Near optimum error correcting coding and decoding: turbo codes[J]. IEEE Trans on Communications, 1996,44(10) :1261-1271. 被引量:1

引证文献2

二级引证文献19

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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