Name
Abstract | ||
|---|---|---|
The short paper proposes a method for constructing regular quasi-cyclic (QC) LDPC codes based on circulant permutation matrices via simple prime field operations. The main advantage is that regular QC LDPC codes with a variety of block lengths and rates can be easily constructed which have no cycles of length four or less. Simulation results show that within only a maximum of ten decoding iterations of sum-product algorithm(SPA) the constructed regular codes of high rates have no error floor down to the bit-error rate of $10^{-7}$. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/IIHMSP.2010.120 | IIH-MSP |
Keywords | Field | DocType |
high rate,regular qc ldpc code,regular quasi-cyclic ldpc codes,regular quasi-cyclic,bit-error rate,regular code,decoding iteration,error floor,ldpc code,prime fields,circulant permutation matrix,block length,bit error rate,awgn,shannon limit,decoding,matrices,encoding,sparse matrices | Prime (order theory),Discrete mathematics,Combinatorics,Low-density parity-check code,Block code,Turbo code,Permutation matrix,Circulant matrix,Decoding methods,Mathematics,Noisy-channel coding theorem | Conference |
Citations | PageRank | References |
1 | 0.36 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Qingji Zheng | 1 | 255 | 10.74 |
| Xiangxue Li | 2 | 232 | 29.98 |
| Dong Zheng | 3 | 335 | 43.37 |
| Baoan Guo | 4 | 39 | 4.03 |