Low-complexity bound on irregular LDPC belief-propagation decoding thresholds using a Gaussian approximation

作者：Vatta F^*; Soranzo A; Babich F

来源：Electronics Letters, 2018, 54(17): 1038-1039.

DOI：10.1049/el.2018.0478

• AWGN channels
• parity check codes
• channel coding
• decoding
• binary codes
• Gaussian processes
• approximation theory
• irregular LDPC belief-propagation decoding thresholds
• Gaussian approximation
• threshold phenomenon
• memoryless binary input additive white Gaussian noise channels
• sum-product decoding
• belief-propagation decoding algorithm
• message densities
• density evolution
• regular LDPC codes
• irregular LDPC codes
• irregular low-density parity-check codes
• low-complexity upper bound

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.

• 出版日期2018-8-23