Name
Title | ||
|---|---|---|
Array based quasi-cyclic LDPC codes and their tight lower bounds on the lifting degree. |
Abstract | ||
|---|---|---|
In this paper, we study a special class of quasi-cyclic LDPC (QC-LDPC) codes, the array codes proposed by J. Fan. We first generalize the array codes from primes to arbitrary positive integers, and then construct QC-LDPC codes by employing the row and column selection method. For given numbers of rows and columns, we can obtain the non-isomorphic row and column index sets based on isomorphism theory, and then construct non-isomorphic QC-LDPC codes accordingly. Based on cycle distributions of the constructed codes, the excellent QC-LDPC codes can be selected. Numerical results show that the proposed QC-LDPC codes have good performance under iterative decoding. Furthermore, based on the exhaustive search of the non-isomorphic row and column index sets, tight lower bounds on the lifting degree of array based QC-LDPC codes can be also obtained for a given girth value. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.phycom.2019.100765 | Physical Communication |
Keywords | Field | DocType |
LDPC codes,Quasi-cyclic,Girth,Row and column selection,Isomorphism theory | Integer,Row and column spaces,Discrete mathematics,Brute-force search,Computer science,Low-density parity-check code,Index set,Real-time computing,Isomorphism,Decoding methods | Journal |
Volume | ISSN | Citations |
36 | 1874-4907 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hai Zhu | 1 | 87 | 22.69 |
| Bo Zhang | 2 | 95 | 47.19 |
| Mengmeng Xu | 3 | 0 | 0.34 |
| Huaan Li | 4 | 0 | 4.06 |
| Hengzhou Xu | 5 | 12 | 12.24 |