期刊文献+

NEW CONSTRUCTIONS OF LDPC CODES BASED ON CIRCULANT PERMUTATION MATRICES FOR AWGN CHANNEL 被引量:2

NEW CONSTRUCTIONS OF LDPC CODES BASED ON CIRCULANT PERMUTATION MATRICES FOR AWGN CHANNEL
在线阅读 下载PDF
导出
摘要 Two new design approaches for constructing Low-Density Parity-Check(LDPC) codes are proposed.One is used to design regular Quasi-Cyclic LDPC(QC-LDPC) codes with girth at least 8.The other is used to design irregular LDPC codes.Both of their parity-check matrices are composed of Circulant Permutation Matrices(CPMs).When iteratively decoded with the Sum-Product Algorithm(SPA),these proposed codes exhibit good performances over the AWGN channel. Two new design approaches for constructing Low-Density Parity-Check (LDPC) codes are proposed. One is used to design regular Quasi-Cyclic LDPC (QC-LDPC) codes with girth at least 8. The other is used to design irregular LDPC codes. Both of their parity-check matrices are composed of Circulant Permutation Matrices (CPMs). When iteratively decoded with the Sum-Product Algorithm (SPA), these proposed codes exhibit good performances over the AWGN channel.
出处 《Journal of Electronics(China)》 2014年第2期85-91,共7页 电子科学学刊(英文版)
基金 Supported by the National Natural Science Foundation of China(Nos.61271199,61172022)
关键词 Circulant Permutation Matrices(CPMs) Euclidean geometry Error floor Irregular LDPC codes Quasi-cyclic Circulant Permutation Matrices (CPMs) Euclidean geometry Error floor IrregularLDPC codes Quasi-cyclic
  • 相关文献

参考文献12

  • 1R.G.Gallager.Low-density parity-check codes.IRE Transactions on Information Theory,8(1962)1,21-28.
  • 2X.F.Wu,X.H.You,and C.M.Zhao.A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes.IEEE T.ransactions on Communications,56(2008)6,854-857.
  • 3K.K.Liu,Z.S.Fei,J.M.Kuang,and X.M.Li.A novel algorithm for removing cycles in quasi-cyclic LDPC codes.IEEE Symposium on Personal,Indoor and Mobile Radio Commnnications,Tokyo,Japan,September 2009,1054-1058.
  • 4T.J.Richardson and R.L.Urbanke.Efficient en-coding of quasi-cyclic LDPC codes.IEEE Transac tions on Information Theory,47(2001)2,638-656.
  • 5T.J.Richardson,M.A.Shokrollahi,and R.L.Ur-banke.Design of capacity-approaching irregular low-density parity-check codes.IEEE Transactions on Information Theory,47(2001)2,619-637.
  • 6P.Trifonov.Design of structured irregular LDPC codes.IEEE Region 8 International Conference on Computational Technologies in Electrical and Elec-tronics Engineering,Novosibirsk,Russia,July 2008,20-24.
  • 7J.Xu,L.Chen,S.Lin,et al.Construction of regular and irregular LDPC codes:geometry decomposition and masking.IEEE Transactions on Information Theory,53(2007)1,121-134.
  • 8S.A M.Baghdady,Y.A.Fahmy,and M.M.S.ElSoudani.An incremental redundancy short length LDPC codes based on random construction tech-niques.IEEE International Conference on Telecom-munications,Doha,Qatar,April 2010,18-22.
  • 9Y.Kou,S.Lin,and M.Fossorier.Low-density parity-check codes based on finite geometries:a rediscoveryand new results.IEEE Transactions on Information Theory,47(2001)11,2711-2736.
  • 10L.Q.Zeng,L.Lan,Y.Y.Tai,et al.Construction of LDPC codes for AWGN and binary erasure channels based on finite fields.IEEE Information Theory Workshop,Rotorua,New Zealand,August 2005,273-276.

同被引文献10

引证文献2

二级引证文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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