On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding
Information Theory
2025-07-10 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2507.06635,
title = {On the Convergence Speed of Spatially Coupled LDPC Ensembles Under Window Decoding},
author = {Qingqing Peng and Dongxu Chang and Guanghui Wang and Guiying Yan},
journal= {arXiv preprint arXiv:2507.06635},
year = {2025}
}
Comments
spatially coupled LDPC ensembles, window decoding, density evolution, convergence speed