Noise-aided gradient descent bit-flipping decoders approaching maximum likelihood decoding

D. Declercq, C. Winstead, B. Vasic, F. Ghaffari, P. Ivanis, E. Boutillon

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations

Abstract

In the recent literature, the study of iterative LDPC decoders implemented on faulty-hardware has led to the counter-intuitive conclusion that noisy decoders could perform better than their noiseless version. This peculiar behavior has been observed in the finite codeword length regime, where the noise perturbating the decoder dynamics help to escape the attraction of fixed points such as trapping sets.

Original languageEnglish (US)
Title of host publication2016 9th International Symposium on Turbo Codes and Iterative Information Processing
Subtitle of host publicationPaths to 5G and Beyond, ISTC 2016
PublisherIEEE Computer Society
Pages300-304
Number of pages5
ISBN (Electronic)9781509034017
DOIs
StatePublished - Oct 17 2016
Event9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016 - Brest, France
Duration: Sep 5 2016Sep 9 2016

Publication series

NameInternational Symposium on Turbo Codes and Iterative Information Processing, ISTC
Volume2016-October
ISSN (Print)2165-4700
ISSN (Electronic)2165-4719

Other

Other9th International Symposium on Turbo Codes and Iterative Information Processing, ISTC 2016
CountryFrance
CityBrest
Period9/5/169/9/16

Keywords

  • LDPC codes
  • MLD performance
  • Noisy GDBF
  • Noisy iterative decoding
  • Probabilistic GDBF

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Information Systems
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Noise-aided gradient descent bit-flipping decoders approaching maximum likelihood decoding'. Together they form a unique fingerprint.

Cite this