Some results on spatially coupled protograph LDPC codes
| Autor: | Lara Dolecek, Dariush Divsalar, Kasra Vakilinia, Sudarsan V. S. Ranganathan, Richard D. Wesel |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Discrete mathematics
Block code 060102 archaeology Concatenated error correction code 020206 networking & telecommunications 06 humanities and the arts 02 engineering and technology Sequential decoding Serial concatenated convolutional codes Binary erasure channel Binary symmetric channel 0202 electrical engineering electronic engineering information engineering 0601 history and archaeology Low-density parity-check code Algorithm Decoding methods Computer Science::Information Theory Mathematics |
| Zdroj: | ITA |
| DOI: | 10.1109/ita.2016.7888150 |
| Popis: | Spatially coupled low-density parity-check block codes (SC-LDPC-BCs) are a class of LDPC codes in which certain ensembles achieve capacity under iterative belief propagation decoding. Prior work has considered these codes mostly from a protograph perspective. Following this viewpoint, our work presents new protographs for the design of protograph-based SC-LDPC-BCs. A reciprocal channel approximation (RCA) analysis of the terminated protographs yields the asymptotic performance limits of the ensembles in terms of their iterative decoding thresholds. Our protographs possess the properties of linear minimum distance growth rate and excellent thresholds. We consider the following channels in our work: binary-input additive white Gaussian noise channel (BI-AWGNC), binary erasure channel (BEC), and binary symmetric channel (BSC). Our work focuses on obtaining good designs, with two classes of ensembles being asymptotically regular, for all the three channels while minimizing rate loss. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|