Name
Abstract | ||
|---|---|---|
On dispersing different base matrices combined with masking, different kinds of quasi-cyclic low-density parity check (QC-LDPC) codes are constructed, which may achieve good error performances. Two new algebraic constructions of regular QC-LDPC codes are presented in this paper. The two constructions are based on two base matrices by dispersing and masking. The two base matrices are based on the generators of the cyclic group of a prime field. Results show that the two classes of codes presented in this paper perform well with iterative decoding over AWGN channel and have advantages over MacKay codes in some aspects of code performances. We find that one of the constructed codes converges very fast with iterative decoding, which is a critical property in ultra-high throughput communication systems. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/VTCSpring.2015.7145673 | 2015 IEEE 81st Vehicular Technology Conference (VTC Spring) |
Keywords | Field | DocType |
prime fields,ultra-high throughput communication systems,MacKay codes,AWGN channel,iterative decoding,cyclic group,dispersing,algebraic constructions,QC-LDPC codes,quasi-cyclic low-density parity check codes,masking,base matrices | Discrete mathematics,Concatenated error correction code,Group code,Low-density parity-check code,Computer science,Block code,Turbo code,Serial concatenated convolutional codes,Raptor code,Linear code | Conference |
ISSN | Citations | PageRank |
1550-2252 | 0 | 0.34 |
References | Authors | |
7 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rui Zhang | 1 | 63 | 11.33 |
| Guixia Kang | 2 | 106 | 36.59 |
| Ningbo Zhang | 3 | 64 | 4.63 |
| Xiaoshuang Liu | 4 | 5 | 4.15 |
| Hao Wu | 5 | 4 | 1.77 |