Generalized LDPC Codes With Low-Complexity Decoding and Fast Convergence

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...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE wireless communications letters Vol. 14; no. 11; pp. 3700 - 3704
Main Authors:	Simegn, Dawit, Artemasov, Dmitry, Andreev, Kirill, Rybin, Pavel, Frolov, Alexey
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.11.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	5G mobile communication Algorithms Codes Convergence Cordaro–Wagner codes Decoding decoding algorithms density evolution Error correcting codes Generalized LDPC codes Iterative decoding Message passing Pulse modulation Schedules Symbols Training
ISSN:	2162-2337, 2162-2345
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!