Name
Abstract | ||
|---|---|---|
In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density paritycheck (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). To reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft belief propagation (BP) estimate is used for the q-ary SC-LDPC codes. Two regimes are considered: one when the constraint length of q-ary SC-LDPC codes is equal to the block length of q-ary LDPC-BCs and the other when the two decoding latencies are equal. Simulation results confirm that, in both regimes, (3,6)-, (3,9)-, and (3,12)-regular non-binary SC-LDPC codes can significantly outperform both binary and non-binary LDPC-BCs and binary SC-LDPC codes. Finally, we present a computational complexity comparison of q-ary SC-LDPC codes and q-ary LDPC-BCs under equal decoding latency and equal decoding performance assumptions. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TCOMM.2015.2397433 | Communications, IEEE Transactions |
Keywords | Field | DocType |
Decoding,Iterative decoding,Pipelines,Block codes,Computational complexity | Discrete mathematics,Concatenated error correction code,Sequential decoding,Computer science,Low-density parity-check code,Block code,Serial concatenated convolutional codes,Turbo code,Linear code,List decoding | Journal |
Volume | Issue | ISSN |
63 | 3 | 0090-6778 |
Citations | PageRank | References |
12 | 0.59 | 19 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kechao Huang | 1 | 60 | 5.65 |
| David G. M. Mitchell | 2 | 147 | 20.94 |
| Lai Wei | 3 | 12 | 0.59 |
| Xiao Ma | 4 | 487 | 64.77 |
| Daniel J. Costello Jr. | 5 | 375 | 39.29 |