Multiple-Rate Quasi-Cyclic LDPC Codes Based on Euclidean Geometries

Xueqin JIANG  Moon Ho LEE  Tae Chol SHIN  

IEICE TRANSACTIONS on Communications   Vol.E93-B   No.4   pp.997-1000
Publication Date: 2010/04/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E93.B.997
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Fundamental Theories for Communications
QC LDPC codes,  rate,  Euclidean geometry,  µ-flats,  parallel bundle,  Galois field,  

Full Text: PDF(113.3KB)>>
Buy this Article

This letter presents an approach to the construction of multiple-rate quasi-cyclic (QC) low-density parity-check (LDPC) codes based on hyperplanes (µ-flats) of two different dimensions in Euclidean geometries. The codes constructed with this method have the same code length, multiple-rate and large stopping sets while maintaining the same basic hardware architecture. The code performance is investigated in terms of the bit error rate (BER) and compared with those of the LDPC codes which are proposed in IEEE 802.16e standard. Simulation results show that our codes perform very well and have low error floors over the AWGN channel.