Generalized LDPC codes with low-complexity decoding and fast convergence
By: Dawit Simegn , Dmitry Artemasov , Kirill Andreev and more
Potential Business Impact:
Makes internet faster with better error fixing.
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.
Similar Papers
Generalized Quasi-Cyclic LDPC Codes: Design and Efficient Encoding
Information Theory
Makes phones send messages faster and more reliably.
On the High-Rate FDPC Codes: Construction, Encoding, and a Generalization
Information Theory
Makes data sent over the internet more reliable.
Layered Normalized Min-Sum Decoding with Bit Flipping for FDPC Codes
Information Theory
Fixes errors in digital messages faster.