Name
Abstract | ||
|---|---|---|
We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with improved decoding speed compared with conventional, uniform smoothing constructions. This leads to a significantly better performance under decoder complexity constraints while keeping the degree distribution regular. We optimize smoothing configurations using differential evolution and illustrate the performance gains by means of a simulation. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/ITW44776.2019.8989360 | 2019 IEEE Information Theory Workshop (ITW) |
Keywords | Field | DocType |
nonuniform coupling,improved decoding speed,low-density parity-check codes,low-complexity windowed decoders,decoder complexity constraints,spatially coupled LDPC codes,finite smoothing parameters,smoothing configurations | Coupling,Low-density parity-check code,Computer science,Algorithm,Differential evolution,Theoretical computer science,Smoothing,Degree distribution,Decoding methods | Conference |
Volume | ISSN | ISBN |
abs/1904.07026 | 2475-420X | 978-1-5386-6901-3 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Schmalen, Laurent | 1 | 112 | 32.50 |
| Vahid Aref | 2 | 58 | 6.49 |