Design of Quasi-Cyclic LDPC Codes Based on Euclidean Geometries
Yuanhua Liu, Xinmei Wang, Jianhua Ma
This paper presents an algebraic method for constructing quasi-cyclic (QC) low-density parity-check (LDPC) codes based on the structural properties of Euclidean geometries. The construction method results in a class of QC-LDPC codes with girth of at least 6. Codes in this class perform very close to the Shannon limit with iterative decoding. Simulations show that the designed QC-LDPC codes have almost the same performance with the existing QC Euclidean geometry LDPC codes.
International Conference on Advanced Information Networking and Applications (AINA)•Jan 1, 2009•7 citations