Extrinsic tree decoding

Eric Psota, Lance C. Pérez

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

4 Scopus citations

Abstract

A new decoding method, called extrinsic tree decoding, is presented for decoding low-density parity-check codes on modified finite computation trees. The proposed method maintains similar performance to that of existing iterative decoders, while providing a decoding method for which realistic upper bounds can be computed for practical codes.

Original languageEnglish (US)
Title of host publicationProceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009
Pages406-410
Number of pages5
DOIs
StatePublished - 2009
Event43rd Annual Conference on Information Sciences and Systems, CISS 2009 - Baltimore, MD, United States
Duration: Mar 18 2009Mar 20 2009

Publication series

NameProceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009

Other

Other43rd Annual Conference on Information Sciences and Systems, CISS 2009
Country/TerritoryUnited States
CityBaltimore, MD
Period3/18/093/20/09

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Fingerprint

Dive into the research topics of 'Extrinsic tree decoding'. Together they form a unique fingerprint.

Cite this