Large girth quasi-cyclic LDPC codes based on the Chinese remainder theorem

Authors:
Xueqin Jiang;Moon Ho Lee
Affiliations:
Institute of Information and Communication, Chonbuk National University, Chonju, Korea;Institute of Information and Communication, Chonbuk National University, Chonju, Korea
Venue:
IEEE Communications Letters
Year:
2009

Citing 3
Cited 0

Quasicyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory
Algebraic construction of sparse matrices with large girth

IEEE Transactions on Information Theory
Shortened Array Codes of Large Girth

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this letter, we consider two problems associated with quasi-cyclic low-density parity-check (QC-LDPC) codes. The first is how to extend the code length of a QC-LDPC code without reducing the girth. The second is how to design a QC-LDPC code with a prescribed girth easily. We deal with these two problems by using a combining method of QC-LDPC codes via the Chinese Remainder Theorem (CRT). Codes constructed with our proposed method have flexible code lengths, flexible code rates and large girth. Simulation results show that they perform very well with the iterative decoding.