期刊文献+

一种基于修饰技术的改进QC-LDPC码构造方法

An Improved Construction Method of QC-LDPC Codes Based on Making Technology
下载PDF
导出
摘要 基于修饰技术提出了一种改进的准循环低密度奇偶校验(QC-LDPC)码的构造方法。该方法构造的QC-LDPC码具有较低的编码复杂度,其校验矩阵围长至少为6,避免了四环的出现,具有良好的围长特性。仿真分析表明:通过该构造方法构造的码率为93.7%的QC-LDPC(3969,3717)码在降低其编码复杂度的情况下,拥有与其对应的未应用修饰技术的QC-LDPC(3969,3719)码相媲美的纠错性能;并且在相同条件下,QC-LDPC(3969,3717)码的纠错性能要好于利用随机构造方法构造的PEG-LDPC(3969,3720)码,以及ITU-T G.975中已广泛用于光通信系统中的RS(255,239)码和LDPC(32640,30592)码,更适合于光通信系统。 An improved construction method of quasi-cyclic low-density parity-check(QCLDPC)codes,based on the making technology is presented.The QC-LDPC codes constructed by this improved construction method have lower encoding complexity,and their parity-check matrices can effectively avoid the girth-4phenomena and have the advantages such as better girthlength properties and more flexible adjustment in the code-length code-rate.The simulation results show that the error-correction performance of the QC-LDPC(3969,3717)with the coderate of 93.7%constructed by this improved construction method is as good as the error-correction performance of the QC-LDPC(3969,3719)code which is constructed without the making technology.Furthermore,at the same simulation conditions,the error-correction performance of the QC-LDPC(3969,3717)is better than that of the PEG-LDPC(3969,3720)code constructed by the random construction method,the classic RS(255,239)code which is widely used in optical communication systems and the LDPC(32640,30592)code in ITU-T G.975.1.Therefore,it is more suitable for optical communication systems.
出处 《半导体光电》 CAS 北大核心 2016年第2期248-251,共4页 Semiconductor Optoelectronics
基金 国家自然科学基金项目(61472464) 重庆市基础与前沿研究计划项目(cstc2015jcyjA0554 cstc2013jcyjA40017) 重庆邮电大学(重庆市)研究生科研创新项目(CYS14144)
关键词 准循环低密度奇偶校验码 修饰技术 净编码增益(NCG) 光通信 QC-LDPC codes making technology net coding gain optical communication
  • 相关文献

参考文献5

二级参考文献30

  • 1FELSTROM A J, ZIGANGIROV K S. Time-varying peri- odic convolutional codes with low-density parity-check matrix [ J ]. IEEE Transactions on Information Theory, 2009, 45(6) :2181-2191.
  • 2LENTMAIER M, FETTWEIS G P, ZIGANGIROV K S, etal. Approaching capacity with asymptotically regular LDPC codes [ C ]// IEEE. Information Theory and Ap- plications Workshop (ITA). San Diego, CA: IEEE Con- ference Publication, 2009: 173-177.
  • 3KUDEKAR S, RICHARDSON T, URBANKE R. Thresh- old saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC [ C ]// IEEE. International Symposium on Information Theory Proceedings (ISIT). Austin, TX: IEEE Conference Pub- lication, 2010: 684-688.
  • 4IYENGAR A R, PAPALEO M, SIEGEL P H, et al. Windowed Decoding of Protograph-Based LDPC Convolu- tional Codes Over Erasure Channels [ J]. IEEE Transac- tions on Information Theory, 2012, 58(4), 2303-2320.
  • 5CORAZZA G E, IYENGAR A R, PAPALEO M, et al. Latency constrained protograph-based LDPC convolutional codes [ C ]//IEEE. IEEE 6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC). Brest: IEEE Conference Publication, 2010: 6-10.
  • 6THORPE J. Low Density Parity Check (LDPC) Codes Constructed from Protographs [C]//Tech. Rep. Progress Report. Pasadena, CA, USA: JPL IPN, 2003: 42-154.
  • 7LENTMAIER M, MITCHELL D G M, FETTWEIS G P, et al. Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity [ C ]//IEEE Infor- mation Theory and Applications Workshop (ITA). San Di- ego, CA : IEEE Conference Publication, 2010 : 1-8.
  • 8MITCHELL D G M, LENTMAIER M, COSTELLO D J. New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes [ C ]// IEEE. International Symposium on Information Theory Proceedings (ISIT). Austin, TX: IEEE Confer- ence Publication, 2010: 824-828.
  • 9DIVSALAR D, DOLINAR S, JONES C. Construction of Protograph LDPC Codes with Linear Minimum Distance [ C ]//IEEE International Symposium on Information The- ory Proceedings (ISIT). Seattle, WA: IEEE Conference Publication, 2006 : 664-668.
  • 10LIVA G, IANI M. Protograph LDPC Codes Design Based on EXIT Analysis [ C]// IEEE. IEEE Communications Society subject. Washington DC : IEEE Globecom, 2007 : 3250-3254.

共引文献18

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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