Name
Title | ||
|---|---|---|
Low complexity construction for quasi-cyclic low-density parity-check codes by Progressive-Block Growth. |
Abstract | ||
|---|---|---|
In this paper, a novel method for constructing quasi-cyclic LDPC codes with low complexity is proposed. By choosing each circulant
permutation matrix sequentially, the proposed method ensures that the current circulant permutation matrix forms no cycles
of length smaller than g with the existent circulant permutation matrices. The construction complexity of the proposed algorithm is much lower than
that of the random construction. Simulation results show that the proposed QC-LDPC codes can outperform both the random regular
LDPC codes with short to moderate block lengths, and the proposed construction method LDPC codes based on the finite geometries
in terms of bit-error-rate (BER). |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s11432-010-4152-0 | SCIENCE CHINA Information Sciences |
Keywords | Field | DocType |
bit error rate,ldpc code | Discrete mathematics,Concatenated error correction code,Error floor,Low-density parity-check code,Turbo code,Block code,Permutation matrix,Circulant matrix,Construction method,Mathematics | Journal |
Volume | Issue | ISSN |
54 | 2 | null |
Citations | PageRank | References |
1 | 0.36 | 16 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pinyi Ren | 1 | 696 | 89.30 |
| Qiang Yuan | 2 | 1 | 0.36 |
| Rui Wang | 3 | 1 | 0.36 |
| Jun Cai | 4 | 373 | 39.29 |