On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866918087282917376 |
|---|---|
| author | Peng, Qingqing Chang, Dongxu Wang, Guanghui Yan, Guiying |
| author_facet | Peng, Qingqing Chang, Dongxu Wang, Guanghui Yan, Guiying |
| contents | It is known that windowed decoding (WD) can effectively balance the performance and complexity of spatially coupled low-density parity-check (LDPC) codes. In this study, we show that information can propagate in a wave-like manner at a constant speed under WD. Additionally, we provide an upper bound for the information propagation speed on the binary erasure channel, which can assist in designing the number of iterations required within each window. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_06635 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding Peng, Qingqing Chang, Dongxu Wang, Guanghui Yan, Guiying Information Theory It is known that windowed decoding (WD) can effectively balance the performance and complexity of spatially coupled low-density parity-check (LDPC) codes. In this study, we show that information can propagate in a wave-like manner at a constant speed under WD. Additionally, we provide an upper bound for the information propagation speed on the binary erasure channel, which can assist in designing the number of iterations required within each window. |
| title | On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding |
| topic | Information Theory |
| url | https://arxiv.org/abs/2507.06635 |