Generalized LDPC codes with low-complexity decoding and fast convergence
Preprint
Abstract
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.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- On the Gap to Channel Capacity of Generalized Low-Density Parity-Check CodesIEEE Open Journal of the Communications Society, 2025
- Generalized LDPC Codes for Ultra Reliable Low Latency Communication in 5G and BeyondIEEE Access, 2018
- Doubly Generalized LDPC Codes over the AWGN ChannelIEEE Transactions on Communications, 2009
- Quasi-cyclic generalized ldpc codes with low error floorsIEEE Transactions on Communications, 2008
- Application of efficient Chase algorithm in decoding of generalized low-density parity-check codesIEEE Communications Letters, 2002
- Convergence behavior of iteratively decoded parallel concatenated codesIEEE Transactions on Communications, 2001
- Minimum-distance bounds by graph analysisIEEE Transactions on Information Theory, 2001
- Factor graphs and the sum-product algorithmIEEE Transactions on Information Theory, 2001
- On generalized low-density parity-check codes based on Hamming component codesIEEE Communications Letters, 1999
- Optimum(n,2)codes for small values of channel error probability (Corresp.)IEEE Transactions on Information Theory, 1967