Name
Abstract | ||
|---|---|---|
A novel block triple-diagonal (BTD) parity structure with all nodes of degree three is proposed for quasi-cyclic (QC) low-density parity-check (LDPC) codes. The BTD structure without low node degree can effectively improve the error floor performance and, meanwhile, enable low complexity encoding. With this structure, we use a modulo-lifting technology to construct a family of QC-LDPC codes, which supports scalable code lengths with a simple and flexible encoding solution. The simulation results show that our coding schemes for short and moderate lengths achieve better performance in the error floor region. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/LCOMM.2017.2712187 | IEEE Communications Letters |
Keywords | Field | DocType |
Encoding,Greedy algorithms,Complexity theory,Parity check codes,5G mobile communication,Mathematical model,Simulation | Error floor,Computer science,Low-density parity-check code,Block code,Algorithm,Computer network,Greedy algorithm,Theoretical computer science,Coding (social sciences),Parity (mathematics),Encoding (memory),Scalability | Journal |
Volume | Issue | ISSN |
21 | 9 | 1089-7798 |
Citations | PageRank | References |
0 | 0.34 | 11 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiaoning Wu | 1 | 6 | 1.11 |
| Ming Jiang | 2 | 198 | 31.08 |
| Chunming Zhao | 3 | 671 | 64.30 |