A lattice-based systematic recursive construction of quasi-cyclic LDPC codes |
| |
Authors: | Esmaeili M Tadayon MH |
| |
Affiliation: | Dept. of Math. Sci., Isfahan Univ. of Technol., Isfahan, Iran; |
| |
Abstract: | This paper presents a low-complexity recursive and systematic method to construct good well-structured low-density parity-check (LDPC) codes. The method is based on a recursive application of a partial Kronecker product operation on a given gamma x q, q ges 3 a prime, integer lattice L(gamma x q). The (n - 1)- fold product of L(gamma x q) by itself, denoted Ln(gamma x q), represents a regular quasi-cyclic (QC) LDPC code, denoted (see PDF), of high rate and girth 6. The minimum distance of (see PDF) is equal to that of the core code (see PDF) introduced by L(gamma x q). The support of the minimum weight codewords in (see PDF) are characterized by the support of the same type of codewords in (see PDF). From performance perspective the constructed codes compete with the pseudorandom LDPC codes. |
| |
Keywords: | |
|
|