期刊文献+

低存储可线性编码的QC-LDPC码设计

QC-LDPC code design with low hardware storage and linear encoding
下载PDF
导出
摘要 为了解决构造任意长度、无小停止集且无短环QC-LDPC码的设计问题,研究了基于Tanner图的停止集、围长和最小码重三者之间的关系,提出了QC-LDPC码无短停止距离且无短环的充要条件.在此基础上,为了进一步降低编码复杂度并保留结构化特性,提出了一种具有线性编码复杂度的基于后向迭代的QC-LDPC码.仿真结果表明:所构造的QC-LDPC码的纠错性能与IEEE 802.11n中QC-LDPC码相近,与IEEE 802.16e中QC-LDPC码相比,在误码率为10^(-6)时,可获得0.15 d B的性能增益;此外,该码字只需存储移位因子和单位子矩阵的阶数,所占硬件存储空间明显小于另外2种QC-LDPC码. To solve the design problem of constructing quasi-cyclic low-density parity-check(QCLDPC)codes of any length without small stopping sets or small girth,the relationship among the stopping set,the girth and the minimum weight based on the Tanner graph is investigated.The necessary and sufficient conditions of the QC-LDPC codes without small stopping sets or small girth are proposed.To further reduce the encoding complexity and maintain the structural characteristics,the backward iteration based QC-LDPC code with linear encoding complexity is proposed.The simulation results show that the error correction performance of the constructed QC-LDPC code is similar to that of the QC-LDPC code in IEEE802.lln.And the designed code achieves a performance gain of0.15dB at the bit error rate of10~6compared with the QC-LDPC code in IEEE802.16e.Meanwhile,the proposed code only needs to store the shift factor and the order of the unit sub-matrix,inducing that the hardware storage resource is obviously smaller than those of the other two QC-LDPC codes.
作者 孔令军 姜明 赵春明 Kong Lingjun;Jiang Ming;Zhao Chunming(National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China;College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003 , China)
出处 《东南大学学报(自然科学版)》 EI CAS CSCD 北大核心 2017年第3期421-425,共5页 Journal of Southeast University:Natural Science Edition
基金 中国博士后科学基金资助项目(2015M581698) 国家自然科学基金青年基金资助项目(61501250) 教育部留学回国人员科研启动基金资助项目(BJ215002) 江苏省博士后科研资助计划资助项目(1501037B) 江苏省自然科学基金青年基金资助项目(SJ214029) 江苏省高校自然科学研究面上项目资助项目(14KJB510021) 南京邮电大学引进人才科研启动基金资助项目(NY214015)
关键词 QC-LDPC码 准循环码 停止集 停止距离 围长 low-density parity-check (QC-LDPC) code quasi-cyclic ( QC) code stopping set stopping distance girth
  • 相关文献

参考文献1

二级参考文献13

  • 1Gallager R G. Low density parity check codes [ J ]. IRE Trans Inform Theory, 1962,8( 1 ) :21 -28.
  • 2Fossorier M P C. Quasi-cyclic low-density parity-check codes from circulant permutation matrices [ J ]. IEEE Trans Inform Theory, 2004,50(8) :1788 -1793.
  • 3Tanner R M, Sridhara D, Sridharan A, et al. LDPC block and convolutional codes based on circulant matrices [ J ]. IEEE Trans Inform Theory, 2004,50 ( 12 ) : 2966 - 2984.
  • 4Lan L, Zeng L, Tai Y Y, et al. Construction of quasicyclic LDPC codes for AWGN and binary erasure hannels: a finite field approach [J ]. IEEE Trans Inform Theory, 2007, 53(7) :2429-2458.
  • 5Tian T, Jones C, ViUasenor J D, et al. Selective avoidance of cycles in irregular LDPC code construction[J].IEEE Trans Commun, 2004, 52(8) :1242- 1247.
  • 6Kang J, Fan P, Cao Z. Flexible construction of irregular partitioned permutation LDPC codes with low error floors [ J]. IEEE Commun Letters, 2005,9(6):534- 536.
  • 7Myung S, Yang K. Lifting methods for quasi-cyclic LDPC codes [J]. IEEE Commun Letters, 2006, 10 (6) :489 -491.
  • 8Sharon E, Litsyn S. Construction LDPC codes by error minimization progressive edge growth [ J ]. IEEE Trans Commun, 2008,56( 3 ) :359 - 368.
  • 9Di C, Proietti D, Telatar I E, et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel [ J ]. IEEE Trans Inform Theory, 2002, 48 (6) :1570 - 1579.
  • 10Hu X Y, Eleftheriou E, Arnold D M. Progressive edge-growth Tanner graphs [ C ]//Proc IEEE GLOBE- COM. San Antonio, TX, USA, 2001:995 - 1001.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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