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

利用遗传算法构造QC-LDPC码 被引量：3

Construction of QC-LDPC Codes with Genetic Algorithm
下载PDF
导出
摘要 考虑到围长(girth)对低密度奇偶校验(LDPC)码的影响,提出了一种利用遗传算法构造大girth的准循环LDPC(QC-LDPC)码的新方法。该方法借助于计算机搜索,多次运用遗传算法,分步提高girth,在得到大girth的同时,构造出具有准循环结构的LDPC码。分析发现,该构造方法的复杂度与码长成线性关系。仿真结果表明:在误码率(BER)为10-6时,新方法构造的QC-LDPC码比基于欧式几何构造方法、Gallager和Mackay构造法分别获得约0.15dB、0.5dB和0.2dB的净编码增益(NCG),且因具有准循环结构更易于存储和硬件实现。 A new method is proposed to construct a large girth quasi-cyclic low density parity check（ QC- LDPC） code with Genetic Algorithm（GA） by consideration of LDPC codes under the influence of girth. This method depends on computer search, uses GA repeatedly,improves girth step by step. A large girth is obtained,at the same time LDPC codes with a quasi-cyclic structure is constructed. Analysis shows its complexity has a linear relationship with code length. Simulation results illustrate that when the bit error rate（BER） is 10^-6 QC-LDPC codes constructed with the new method has net coding gain（NCG） of 0.15 dB,0.5 dB,0.2 dB over LDPC code based on Euclidean Geometry, Gallager random codes and Mackay random codes, respectively, and it is easy to restore and be implemented in hardware because of quasi-cy- clic structure.
作者 郑丹玲 穆攀 田凯 袁建国
机构地区 重庆邮电大学光通信与网络重点实验室
出处 《电讯技术》 北大核心 2015年第4期355-359,共5页 Telecommunication Engineering
基金 国家自然科学基金资助项目(61171158) 重庆市自然科学基金资助项目(cstc2013jcyjA40052 cstc2012jjA40060) 重庆市教委科学技术研究项目(KJ130515)~~
关键词 QC-LDPC 大围长 遗传算法 复杂度分析 QC-LDPC large girth genetic algorithm complexity analysis
分类号 TN911.22 [电子电信—通信与信息系统]
  • 相关文献

参考文献12

  • 1Fossorier M P C. Quasi-cyclic low-density parity-checkcodes from circulant permutation matrices[J]. IEEE Trans-actions on Information Theory,2004,50(8):1788-1793.
  • 2黄胜,庞晓磊,田方方,贾雪婷.基于中国剩余定理和贪婪算法扩展的QC-LDPC码[J].电讯技术,2014,54(11):1528-1533. 被引量：1
  • 3Huang Qin,Diao Qinju. Cyclic and Quasi-Cyclic LDPCCodes on Constrained Parity-Check Matrices and TheirTrapping Sets [J]. IEEE Transactions on InformationThrory,2012,59(1):2648-2671.
  • 4Wang Lei, Zhang Xing. QC - LDPC Codes with GirthEight Based on Independent Row-Colunm Mapping Se-quence [J]. IEEE Communications Letters, 2013, 17(11):2140-2143.
  • 5刘原华,张美玲.一种可快速编码的QC-LDPC码构造新方法[J].电讯技术,2013,53(1):55-59. 被引量：4
  • 6Jiang Xueqin,Xia Xianggen. Efficient Progressive Edge-Growth Algorithm Based on Chinees Remainder Theorem[J]. IEEE Transactions on Communications,2014,62(2):442-451.
  • 7Sharon E,Litsyn S. Constructing LDPC codes by errorminimization progressive edge growth[J]. IEEE Transac-tions on Communications,2008,56(3):359-368.
  • 8Tanner R M. Minimum-distance bounds by graph analy-sis[J]. IEEE Transactions on Information Theory,2001,47(2):808-821.
  • 9Hu X Y,Vetterli M. Low-delay low-complexity errorcorrectingcodes on sparse graphs[D]. Switzerland:SwissFederal Insitute of Technology Lausanne(EPFL),2002.
  • 10Yu Kou,Shu Lin,Fossorier M P C. Low-Density Parity-Check Codes Based on Finite Geometries[J]. IEEE Trans-actions on Information theory,2001,47(7):2711-2736.

二级参考文献13

  • 1MacKay D J C,Neal R M. Near Shannon limit perform-ance of low density parity check codes[J]. ElectronicsLetters,1996,32(18):1645.
  • 2Khazraie S,Asvadi R,Banihashemi A H. A PEG construc-tion of finite-Length LDPC codes with low error floor[J].IEEE Communications Letters,2012,16(8):1288-1291.
  • 3Wang L,Zhang X,Yu F,et al. QC-LDPC Codes withGirth Eight Based on Independent Row-Column MappingSequence[J]. IEEE Communications Letters,2013,17(11):2140-2143.
  • 4Fossorier M P C. Quasi-cyclic low-density parity-checkcodes from circulant permutation matrices[J]. IEEE Trans-actions on Information Theory,2004,50(8):1788-1793.
  • 5Fan J L. Array codes as LDPC codes[M] / / ConstrainedCoding and Soft Iterative Decoding. Berlin: Springer,2001:195-203.
  • 6Blaum M,Roth R M. New array codes for multiple phasedburst correction [J]. IEEE Transactions on InformationTheory,1993,39(1):66-77.
  • 7Myung S,Yang K. A combining method of quasi-cyclicLDPC codes by the Chinese remainder theorem[J]. IEEECommunications Letters,2005,9(9):823-825.
  • 8Liu Y,Wang X,Chen R,et al. Generalized combiningmethod for design of quasi - cyclic LDPC codes[J].IEEE Communications Letters,2008,12(5):392-394.
  • 9Jiang X,Lee M H. Large girth quasi-cyclic LDPC codesbased on the chinese remainder theorem[J]. IEEE Com-munications Letters,2009,13(5):342-344.
  • 10Milenkovic O, Kashyap N, Leyba D. Shortened arraycodes of large girth[J]. IEEE Transactions on Informa-tion Theory,2006,52(8):3707-3722.

共引文献3

同被引文献30

  • 1MACKEY D J C,NEAL R M. Near Shannon limit per-formance of low-density parity-check codes[J]. Elec-tronics Letters,1996,33(6):1645-1646.
  • 2JIANG X,XIA X G,LEEM H. Efficient progressive edge-growth algorithm based on chinese remainder theorem[J]. IEEE Transactions on Communications,2014,62(2):442-451.
  • 3LAN L,SHU L. Construction of quasi-cyclic LDPC codesfor AWGN and binary erasure channels:a finite field ap-proach [J]. IEEE Transactions on Communications,2007,53(7):2429-2458.
  • 4KAMIYA N.High-rate quasi-cyclic low-density parity-checkcodes derived from finite affine planes[J]. IEEE Transactionson Information Theory,2007,53(4):1444-1459.
  • 5VASIC B,MILENKOVIC O. Combinatorial constructionsof low-density parity-check codes for iterative decoding[J]. IEEE Transactions on Information Theory,2004,50(6):1156-1176.
  • 6AMMAR B,HONARY B,KOU Y,et al. Construction oflow density parity-check codes based on balanced incom-plete block designs[J]. IIEEE Transactions on Informa-tion Theory,2004,50(6):1257-1268.
  • 7FOSSORIER M P C. Quasi - cyclic low density paritycheck codes from circulant permutation matrices [J].IEEE Transactions on Information Theory,2004,50(8):1788-1793.
  • 8PARK H,HONG S,NO J S,et al. Construction of highrateregular quasi - cyclic LDPC codes based on cyclicdifference families[J]. IEEE Transactions on Communi-cations,2013,61(8):3108-3113.
  • 9ESMAEILI M,JAVEDANKHERAD M. 4-cycle free LDPCcodes based on difference sets[J]. IEEE Transactions onCommunications,2012,60(12):3579-3586.
  • 10GE G N,MIAO Y,SUN X W. Perfect difference fami-lies,perfect difference matrices,and related combinatori-al structures [J]. Journal of Combinatorial Designs,2010,18(6):415-449.

引证文献3

二级引证文献10

电讯技术
2015年 第4期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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