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.
Titolo: | Low-complexity bound on irregular LDPC belief-propagation decoding thresholds using a Gaussian approximation |
Autori: | |
Data di pubblicazione: | 2018 |
Stato di pubblicazione: | Pubblicato |
Rivista: | |
Abstract: | 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. |
Handle: | http://hdl.handle.net/11368/2928430 |
Digital Object Identifier (DOI): | http://dx.doi.org/10.1049/el.2018.0478 |
URL: | http://scitation.aip.org/dbt/dbt.jsp?KEY=ELLEAK |
Appare nelle tipologie: | 1.1 Articolo in Rivista |
File in questo prodotto:
File | Descrizione | Tipologia | Licenza | |
---|---|---|---|---|
BSV-LDPC-EL.pdf | Articolo principale | Bozza finale post-referaggio (post-print) | Copyright Editore | Open Access Visualizza/Apri |
vatta soranzo babich.pdf | Documento in Versione Editoriale | Copyright Editore | Administrator Richiedi una copia |