期刊文献+

光通信中基于行列约束条件的一种新颖QC-LDPC码构造方法

A Novel Construction Method of QC-LDPC Codes Based on the Row-Column Constraint Condition in Optical Communications
原文传递
导出
摘要 基于行列约束条件提出适用于光通信系统中一种新颖的高码率与码长的QC-LDPC码构造方法。该方法可在取得较好纠错性能的同时降低编码复杂度。并利用该方法构造出一种适用于光通信系统的非规则QC-LDPC(3591,3351)码。仿真分析表明:在BER为10^(-7)时,该QC-LDPC(3591,3351)码的净编码增益分别比ITU-T G.975中RS(255,239)码和ITU-T G.975.1中LDPC(32640,30592)码提高2.13d B和1.32d B;且比用SCG方法构造的LDPC(3969,37 20)码和利用有限域乘群方法构造的规则QC-LDPC(5334,4955)码提高0.66 d B和0.40 d B,因而该QC-LDPC码新颖构造方法的纠错性能优越并在光通信系统中具有较好的应用前景。 A novel construction method of Quasi-Cyclic Low-Density Parity-Check(QC-LDPC) codes with the higher code-rate and code-length for optical communications, based on row-column constraint condition, is proposed. The construction method can gain the better error-correction performance and reduce the encoding complexity. A irregular QC-LDPC(3951,3351) code to be suitable for optical communication systems is constructed by applying this construction method. The simulation results show that at the bit error rate(BER) of 10-7, the net encoding gain(NCG) of the irregular QC-LDPC(3591,3351) code is respectively 2.13dB and 1.32dB more than those of the classic RS(255,239) in ITU-T G.975 and LDPC(32640,30592) in ITU-T G.975.1, and respectively 0.66dB and 0.40dB more than those of the SCG-LDPC(3969,3720) code constructed by the systematically-constructed-Gallager(SCG) construction method and the regular QC-LDPC(5334,4962) code constructed by the finite field muhiplicative group method. Therefore, this novel construction method for the QC-LDPC code has the more excellent error-correction performance and the better application prospect in optical communication systems.
出处 《广西通信技术》 2015年第3期36-39,共4页 Guangxi Communication Technology
基金 2013年重庆邮电大学大学生科研训练计划项目(No.A2013-42) 国家自然科学基金项目(No.61371096) 重庆市自然科学基金(No.2010BB2409)
关键词 准循环低密度奇偶校验码 光通信系统 误码率 净编码增益 QC-LDPC Codes optical communication systems bit error rate(BER) net coding gain(NCG)
  • 相关文献

参考文献4

二级参考文献42

  • 1袁建国,叶文伟,毛幼菊.光通信系统中基于LDPC码的SFEC码型研究[J].光电子.激光,2009,20(11):1450-1453. 被引量:10
  • 2GALLAGER R G. Low-density parity check codes [ M ]. Cambridge, MA: MIT Press, 1963.
  • 3THORPE J. Low-density parity-check ( LDPC ) codes constructed from protographs [ C ]//Tech. Rep. Progress Report. Pasadena, CA, USA : JPL IPN, 2003 : 42-154.
  • 4DIVSALAR D, JONES C, THORPE J. Protograph based LDPC codes with minimum distance linearly growing with block size [ C ] HIEEE. IEEE Communications Society subject. ST,louis: IEEE Globecom, 2005: 1152-1156.
  • 5HA J, KIM J, KLINC D, et al. Rate-compatible punc- tured low-density parity-check codes with short block length [ J ]. IEEE Trans Inform Theroy, 2006, 52 ( 2 ) : 728-738.
  • 6YOU Ying, XIAO Min, WANG Lin. The rate-compatible Multi-Edge Type LDPC codes with short block length [ C]//IEEE. Proceedings of the 5th International Confer- ence on Wireless communications ( WiCOM' 09 ). NJ, USA : IEEE Press, 2009 : 1-4.
  • 7LI J, NARAYANNA K. Rate-compatible low density par- ity check codes for capacity-approaching ARQ scheme in packet data communications [ C ]//Proc. Int Conf Comm Internet and Info. Tech (CIIT). Virgin Islands, USA: 2002:201-206.
  • 8MOSTAFA E1-Khamy, HOU Ji-lei, BHUSHAN Naga. Design of rate-compatible structured LDPC codes for Hy- brid ARQ application [ J ]. IEEE J Sele Areas Commun, 2009, 27(6):965-973.
  • 9ABBASFAR A, DIVSALAR D, YAO Kung. Accumulate repeat accumulate codes [ C ]// IEEE International Sym- posium on Information Theory (ISIT). Chicago, USA: IEEE Globecom, 2004:509-513.
  • 10DIVSALAR D. Ensemble weight enumerators for proto- graph LDPC codes [ C]//IEEE. IEEE International Sym- posium on Information Theory (ISIT). Seattle, Washing- ton, USA: IEEE Press, 2006 : 1554-1558.

共引文献39

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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