Message-aggregation enhanced iterative hard-decision decoders

Srdan Brkic, Predrag Ivanis, Bane Vasić, David Declercq

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

Abstract

We present an iterative decoding algorithm for annihilating trapping sets in low-density parity-check codes. In addition to classic messages, subsets of variable nodes communicate directly. We show that by allowing variable nodes to collect information from a larger part of a graph, significant improvement can be achieved in the error-floor region, compared to the classic hard decision decoders. We also propose a new hybrid hard-decision decoding algorithm which employs described strategy and the Gallager B decoders as its components. Our decoder outperforms all known hard-decision decoders of same or higher complexity.

Original languageEnglish (US)
Title of host publication2016 Information Theory and Applications Workshop, ITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509025299
DOIs
StatePublished - Mar 27 2017
Event2016 Information Theory and Applications Workshop, ITA 2016 - La Jolla, United States
Duration: Jan 31 2016Feb 5 2016

Publication series

Name2016 Information Theory and Applications Workshop, ITA 2016

Other

Other2016 Information Theory and Applications Workshop, ITA 2016
Country/TerritoryUnited States
CityLa Jolla
Period1/31/162/5/16

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Artificial Intelligence
  • Information Systems
  • Signal Processing

Fingerprint

Dive into the research topics of 'Message-aggregation enhanced iterative hard-decision decoders'. Together they form a unique fingerprint.

Cite this