Quasi-cyclic LDPC codes based on D and Q matrices through progressive edge growth

Short cycles in the Tanner graph of a low-density parity-check (LDPC) code may cause a severe performance degradation. In this paper, we investigate the cycle properties of quasi-cyclic LDPC (QC-LDPC) codes. We first analyze a necessary and sufficient condition for a cycle of a given length to exist, by using the sequence representation of a parity-check matrix for a QC-LDPC code. We then derive bounds which are necessary conditions for a QC-LDPC code to have a given girth in terms of its parameters. Our necessary conditions are applicable to any regular or irregular QC-LDPC codes as well as they improve the existing bounds for many classes of regular QC-LDPC codes.

show abstract

A modified PEG algorithm for construction of LDPC codes with Polynomial of Cycle

Xiong

Yao

2009

2009 3rd IEEE International Symposium on Microwave, Antenna, Propagation and EMC Technologies for Wireless Communications

View full text Add to dashboard Cite

Quasi-cyclic LDPC codes based on D and Q matrices through progressive edge growth

Cited by 5 publications

References 12 publications

Necessary conditions for avoiding cycles of length 4 or 6 in regular quasi-cyclic LDPC codes

Necessary conditions for avoiding cycles of length 4 or 6 in regular quasi-cyclic LDPC codes

Necessary conditions for quasi-cyclic LDPC codes to have a given girth

A modified PEG algorithm for construction of LDPC codes with Polynomial of Cycle

Contact Info

Product

Resources

About