Name
Abstract | ||
|---|---|---|
Quasi-cyclic (QC) LDPC codes play an important role in 5G communications and have been chosen as the standard codes for 5G enhanced mobile broadband (eMBB) data channel. In this paper, we study the construction of QC LDPC codes based on an arbitrary given expansion factor (or lifting degree). First, we analyze the cycle structure of QC LDPC codes and give the necessary and sufficient condition for the existence of short cycles. Based on the fundamental theorem of arithmetic in number theory, we divide the integer factorization into three cases and present three classes of QC LDPC codes accordingly. Furthermore, a general construction method of QC LDPC codes with girth of at least 6 is proposed. Numerical results show that the constructed QC LDPC codes perform well over the AWGN channel when decoded with the iterative algorithms. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1155/2018/5264724 | WIRELESS COMMUNICATIONS & MOBILE COMPUTING |
Field | DocType | Volume |
Discrete mathematics,Low-density parity-check code,Computer science,Communication channel,Fundamental theorem of arithmetic,Construction method,Additive white Gaussian noise,Mobile broadband,Number theory,Integer factorization,Distributed computing | Journal | 2018 |
ISSN | Citations | PageRank |
1530-8669 | 0 | 0.34 |
References | Authors | |
16 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hai Zhu | 1 | 87 | 22.69 |
| Liqun Pu | 2 | 5 | 2.99 |
| Hengzhou Xu | 3 | 12 | 12.24 |
| Bo Zhang | 4 | 95 | 47.19 |