Encoding Spatially Coupled LDPC Codes With Polynomial Generator Matrices
IEEE Transactions on Information Theory · 2026-08 · 72 (8) · 5473-5489
DOI: 10.1109/tit.2026.3695390 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Information Theory, 2026-08. Verfasst von Massimo Battaglioni und 2 weiteren Autor:innen. Die Arbeit nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Union - Next Generation EU under the Italian National Recovery and Resilience Plan (NRRP), Mission 4, Component 2, Investment 1.3, partnership on “Tel….
Abstract (Originalsprache)
Spatially coupled low-density parity-check (SC-LDPC) codes have recently attracted a lot of attention because of their optimal asymptotic performance. Time-invariant and periodically time-varying SC-LDPC codes are particularly interesting code families, since they have good finite-length performance and allow for a very compact representation. However, one of the key challenges to make SC-LDPC codes practical consists in finding efficient techniques for their encoding. In this paper, we propose a method to construct polynomial generator matrices for time-invariant and periodically time-varying SC-LDPC codes, based on their polynomial parity-check matrix. We show that it is always possible to find a polynomial generator matrix in quasi-standard form, where the systematic part consists of a diagonal matrix with identical entries, enabling efficient and non-catastrophic encoding. We also show that it is always possible to compute an equivalent rational function generator matrix in standard form that guarantees recursive, systematic (and therefore also non-catastrophic) encoding. Finally, to illustrate the method, we introduce a family of time-invariant SC-LDPC codes characterized by a binary parity-check matrix associated to a Tanner graph with girth larger than 4 and by good asymptotic and finite length performance. These codes naturally admit a quasi-standard polynomial generator matrix that, depending on the number of control symbols per period, either can be efficiently converted into polynomial standard form or remains in quasi-standard form but is relatively sparse. Both these features enable fast and efficient encoding.
Förderung
- European Union - Next Generation EU under the Italian National Recovery and Resilience Plan (NRRP), Mission 4, Component 2, Investment 1.3, partnership on “Tel…
Zitieren
APA
Battaglioni, M., Chiaraluce, F., & Baldi, M. (2026). Encoding Spatially Coupled LDPC Codes With Polynomial Generator Matrices. IEEE Transactions on Information Theory, 72(8), 5473-5489. https://doi.org/10.1109/tit.2026.3695390
Vancouver
Battaglioni M, Chiaraluce F, Baldi M. Encoding Spatially Coupled LDPC Codes With Polynomial Generator Matrices. IEEE Transactions on Information Theory. 2026;72(8):5473-5489. doi:10.1109/tit.2026.3695390
BibTeX
@article{Battaglioni2026,
author = {Battaglioni, Massimo and Chiaraluce, Franco and Baldi, Marco},
title = {Encoding Spatially Coupled LDPC Codes With Polynomial Generator Matrices},
journal = {IEEE Transactions on Information Theory},
year = {2026},
volume = {72},
number = {8},
pages = {5473--5489},
doi = {10.1109/tit.2026.3695390}
}
EUVIMED