.png){kind=icon}
.png){kind=icon}
Return
Generalized LDPC Codes With Low-Complexity Decoding and Fast Convergence
.png){kind=icon}
PRE
AI
DOI：10.1109/LWC.2025.3600912.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 a 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:
Codes
Decoding
Iterative decoding
5G mobile communication
Pulse modulation
Convergence
Training
Symbols
Standards
Schedules
Generalized LDPC codes
Cordaro-Wagner codes
decoding algorithms
density evolution
Journal
I
IF:
5.5
Papers:
682
Citations:
0