Generalized LDPC codes with low-complexity decoding and fast convergence
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866910940930244608 |
|---|---|
| author | Simegn, Dawit Artemasov, Dmitry Andreev, Kirill Rybin, Pavel Frolov, Alexey |
| author_facet | Simegn, Dawit Artemasov, Dmitry Andreev, Kirill Rybin, Pavel Frolov, Alexey |
| contents | We consider generalized low-density parity-check (GLDPC) codes with component codes that are duals of Cordaro-Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann-Rudolph processing, analogous to Sum-Product decoding, and another based on evaluating two hypotheses per bit, referred to as the Min-Sum decoder. Both algorithms are derived using latent variables and an appropriate message-passing schedule. A quantized, protograph-based density evolution procedure is used to optimize GLDPC codes for Min-Sum decoding. Compared to 5G LDPC codes, the proposed GLDPC codes offer similar performance at 50 iterations and significantly better convergence and performance at 10 iterations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_08030 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Generalized LDPC codes with low-complexity decoding and fast convergence Simegn, Dawit Artemasov, Dmitry Andreev, Kirill Rybin, Pavel Frolov, Alexey Information Theory We consider generalized low-density parity-check (GLDPC) codes with component codes that are duals of Cordaro-Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann-Rudolph processing, analogous to Sum-Product decoding, and another based on evaluating two hypotheses per bit, referred to as the Min-Sum decoder. Both algorithms are derived using latent variables and an appropriate message-passing schedule. A quantized, protograph-based density evolution procedure is used to optimize GLDPC codes for Min-Sum decoding. Compared to 5G LDPC codes, the proposed GLDPC codes offer similar performance at 50 iterations and significantly better convergence and performance at 10 iterations. |
| title | Generalized LDPC codes with low-complexity decoding and fast convergence |
| topic | Information Theory |
| url | https://arxiv.org/abs/2505.08030 |