New constructions of LDPC codes based on circulant permutation matrices for AWGN channel

详细信息    查看全文

• 作者：Zixi Song (1)
  Lijun Zhang (1)
  
• 关键词：Circulant Permutation Matrices (CPMs) ; Euclidean geometry ; Error floor ; Irregular LDPC codes ; Quasi ; cyclic ; TN911.22
• 刊名：Journal of Electronics (China)
• 出版年：2014
• 出版时间：April 2014
• 年：2014
• 卷：31
• 期：2
• 页码：85-91
• 全文大小：202 KB
• 参考文献：1. R. G. Gallager. Low-density parity-check codes. / IRE Transactions on Information Theory, 8(1962)1, 21鈥?8. CrossRef
  2. X. F. Wu, X. H. You, and C. M. Zhao. A necessary and sufficient condition for determining the girth of quasi-cyclic LDPC codes. / IEEE Transactions on Communications, 56(2008)6, 854鈥?57. CrossRef
  3. K. 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 Communications, Tokyo, Japan, September 2009, 1054鈥?058.
  4. T. J. Richardson and R. L. Urbanke. Efficient encoding of quasi-cyclic LDPC codes. / IEEE Transactions on Information Theory, 47(2001)2, 638鈥?56. CrossRef
  5. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke. Design of capacity-approaching irregular low-density parity-check codes. / IEEE Transactions on Information Theory, 47(2001)2, 619鈥?37. CrossRef
  6. P. Trifonov. Design of structured irregular LDPC codes. IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, Novosibirsk, Russia, July 2008, 20鈥?4.
  7. J. 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鈥?34. CrossRef
  8. S. A M. Baghdady, Y. A. Fahmy, and M. M. S. El-Soudani. An incremental redundancy short length LDPC codes based on random construction techniques. IEEE International Conference on Telecommunications, Doha, Qatar, April 2010, 18鈥?2.
  9. Y. Kou, S. Lin, and M. Fossorier. Low-density parity-check codes based on finite geometries: a rediscovery and new results. / IEEE Transactions on Information Theory, 47(2001)11, 2711鈥?736. CrossRef
  10. L. 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鈥?76.
  11. R. Asvadi, A. H. Banihashemi, and M. Ahmadian-Attari. Lowering the error floor of LDPC codes using cyclic liftings. IEEE International Symposium on Information Theory, Austin, TX, USA, June 2010, 724鈥?28.
  12. D. MacKay. D. MacKay鈥檚 Gallager code resources. http://wol.ra.phy.cam.ac.uk/mackay/codes/, April 2010.
  
• 作者单位：Zixi Song (1)
  Lijun Zhang (1)
  
  1. School of Electronic and Information Engineering, Beijing Jiaotong University, Beijing, 100044, China
  
• ISSN：1993-0615

文摘

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.