
Acceleration of low density parity check code (LDPC) decoding by successive overrelaxations
Author(s) -
Saouter Y.
Publication year - 2018
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2018.5867
Subject(s) - decoding methods , low density parity check code , belief propagation , algorithm , computer science , list decoding , parity bit , convergence (economics) , mathematics , concatenated error correction code , block code , economics , economic growth
Belief propagation and variants are the usual decoding algorithms for low‐density parity check codes. The successive overrelaxations are applied to increase the convergence speed of the decoding process. Performances are reported and improvements over the reference algorithms are observed. This technique is also compatible with the high‐speed parallel group decoding involved in modern standards such as DVB‐S2.