Name
Abstract | ||
|---|---|---|
A new block low-density parity-check (Block-LDPC) code based on quadratic permutation polynomials (QPPs) is proposed. The parity-check matrix of the Block-LDPC code is composed of a group of permutation submatrices that correspond to QPPs. The scheme provides a large range of implementable LDPC codes. Indeed, the most popular quasi-cyclic LDPC (QC-LDPC) codes are just a subset of this scheme. Simulation results indicate that the proposed scheme can offer similar error performance and implementation complexity as the popular QC-LDPC codes. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/JCN.2015.000029 | Journal of Communications and Networks |
Keywords | Field | DocType |
Polynomials,Complexity theory,Bit error rate,Indexes,Iterative decoding,Encoding | Discrete mathematics,Concatenated error correction code,Low-density parity-check code,Computer science,Block code,Serial concatenated convolutional codes,Turbo code,Permutation,Raptor code,Linear code | Journal |
Volume | Issue | ISSN |
17 | 2 | 1229-2370 |
Citations | PageRank | References |
1 | 0.36 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wu Guan | 1 | 3 | 1.11 |
| Liping Liang | 2 | 13 | 5.14 |