Open AccessLow‐complexity bound on irregular LDPC belief‐propagation decoding thresholds using a Gaussian approximation
Author(s) -
Vatta F.,
Soranzo A.,
Babich F.
Publication year - 2018
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2018.0478
Subject(s) - belief propagation , low density parity check code , decoding methods , algorithm , list decoding , mathematics , additive white gaussian noise , sequential decoding , gaussian , upper and lower bounds , binary number , factor graph , discrete mathematics , computer science , concatenated error correction code , block code , white noise , arithmetic , statistics , physics , quantum mechanics , mathematical analysis
Since irregular low‐density parity‐check (LDPC) codes are known to perform better than regular ones, and to exhibit, like them, the so‐called ‘threshold phenomenon’, this Letter investigates a low‐complexity upper bound on belief‐propagation decoding thresholds for this class of codes on memoryless binary input additive white Gaussian noise channels, with sum‐product decoding. A simplified analysis of the belief‐propagation decoding algorithm is used, i.e. consider a Gaussian approximation for message densities under density evolution, and a simple algorithmic method, defined recently, to estimate the decoding thresholds for regular and irregular LDPC codes.