J4

• Original Articles • Previous Articles     Next Articles

Algorithm for constructing QC_LDPC codes based on the weighted map

HU Jia-yi;WANG Wen-bo

  

  1. (Key Lab. of Universal Wireless Communications, Ministry of Education, Beijing Univ. of Posts and Telecommunications, Beijing 100876, China)
  • Received:2007-10-19 Revised:1900-01-01 Online:2008-10-20 Published:2008-09-12
  • Contact: HU Jia-yi E-mail:jiayihu100@yahoo.com.cn

Abstract: A low complexity algorithm for constructing Quasi_cyclic low-density parity-check (QC_LDPC) codes with a large girth is presented. Based on the weighted graph, the algorithm leads to sets of values of all undetermined positions of the base matrix ensuring QC_LDPC with a large girth. The sets of values are determined without trying every possible value so that the complexity for constructing QC_LDPC codes is greatly reduced. Simulations show the algorithm can construct codes with a large girth which have good performances.

Key words: low-density parity-check codes, cycle, girth, weighted map

CLC Number: 

  • TN919.3