期刊文献+

一种可快速编码的QC-LDPC码构造新方法 被引量:4

A New Design Method for Quasi-cyclic LDPC Codes with Fast Encoding Ability
下载PDF
导出
摘要 为解决LDPC码的编码复杂度问题,使其更易于硬件实现,提出了一种可快速编码的准循环LDPC码构造方法。该方法以基于循环置换矩阵的准循环LDPC码为基础,通过适当的打孔和行置换操作,使构造码的校验矩阵具有准双对角线结构,可利用校验矩阵直接进行快速编码,有效降低了LDPC码的编码复杂度。仿真结果表明,与IEEE 802.16e中的LDPC码相比,新方法构造的LDPC码在低编码复杂度的基础上获得了更好的纠错性能。 A new design of quasi-cyclic (QC) LDPC codes with easier hardware implementation is proposed to lower the encoding complexity. Based on the QC-LDPC codes with circulant permutation matrices, the masking method and line permutations are utilized to make the parity-check matrix have the quasi-dual-diagonal structure, and the fast encoding algorithm directly from the parity-check matrix can reduce the encoding complexity effective- ly. Simulation results show that compmed with the QC-LDPC codes from the IEEE 802.16e standard, the con- structed codes have better performance while maintaining the low encoding complexity.
出处 《电讯技术》 北大核心 2013年第1期55-59,共5页 Telecommunication Engineering
基金 国家自然科学基金资助项目(61001131 61201194 61172071) 陕西省教育厅专项科研计划项目(11JK1007) 西安邮电大学青年教师基金项目(0001286)~~
关键词 低密度奇偶校验码 准循环 循环置换矩阵 快速编码 low-density parity-check codes quasi-cyclic circulant permutation matrix fast encoding
  • 相关文献

参考文献1

二级参考文献10

  • 1L. Lan,L. Q. Zeng,Y. Y. Tai,L. Chen,S. Lin,K. Abdel-Ghaffar.Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: a finite field approach[].IEEE Transactions on Information Theory.2007 被引量:1
  • 2T. R. Halford,K. M. Chugg.An algorithm for counting short cycles in bipartite graphs[].IEEE Transactions on Information Theory.2006 被引量:1
  • 3Y. Y. Tai,L. Lan,L. Q. Zeng,S. Lin,K. Abdel-Ghaffar.Algebraic construction of quasi-cyclic LDPC codes for the AWGN and erasure channels[].IEEE Transactions on Communications.2006 被引量:1
  • 4Jin H,Khandekar A,McEliece R.Irregular repeat-accumulate codes[].Proc nd International Symposium on Turbo codes and Related Topics.2000 被引量:1
  • 5Gallager RG.Low density parity check codes[].IRE Transactions on Information Theory.1962 被引量:1
  • 6S.Lin,and D.J.Costello,Jr.Error Control Coding:Fundamen-tals and Applications[]..2004 被引量:1
  • 7Mackay DJC,Neal RM.Near Shannon limit performance of low density parity check codes[].Electronics Letters.1996 被引量:1
  • 8Y Kou,S Lin,MPC Fossorier.Low-density parity-check codes based on finite geometries: a rediscovery and new results[].IEEE Transactions on Information Theory.2001 被引量:1
  • 9Fossorier M P C.Quasi-Cyclic Low-Density Parity-Check Codes from Circulant Permutation Matrices[].IEEE Transactions on Information Theory.2004 被引量:1
  • 10Liu Yuanhua,Wang Xinmei,Chen Ruwei,et al.Generalized Combining Method for Design of Quasi-Cyclic LDPC Codes[].IEEE Communications Letters.2008 被引量:1

共引文献3

同被引文献24

  • 1MacKay D J C,Neal R M. Near Shannon limit perform-ance of low density parity check codes[J]. ElectronicsLetters,1996,32(18):1645. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 5Fan J L. Array codes as LDPC codes[M] / / ConstrainedCoding and Soft Iterative Decoding. Berlin: Springer,2001:195-203. 被引量:1
  • 6Blaum M,Roth R M. New array codes for multiple phasedburst correction [J]. IEEE Transactions on InformationTheory,1993,39(1):66-77. 被引量:1
  • 7Myung S,Yang K. A combining method of quasi-cyclicLDPC codes by the Chinese remainder theorem[J]. IEEECommunications Letters,2005,9(9):823-825. 被引量:1
  • 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. 被引量:1
  • 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. 被引量:1
  • 10Milenkovic O, Kashyap N, Leyba D. Shortened arraycodes of large girth[J]. IEEE Transactions on Informa-tion Theory,2006,52(8):3707-3722. 被引量:1

引证文献4

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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