LDPC decoding and code design on extrinsic trees

Eric Psota, Lance C Perez

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

5 Scopus citations

Abstract

Extrinsic tree decoding of low-density parity-check codes operates on modified, finite computation trees created from the Tanner graph of the code. The goal of the extrinsic tree algorithm is to maintain or improve the performance of existing iterative decoders, while providing a decoding algorithm for which upper bounds can be computed. The extrinsic tree algorithm is examined, along with the design of parity-check matrices on which the extrinsic tree decoder performs well.

Original languageEnglish (US)
Title of host publication2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages2161-2165
Number of pages5
DOIs
Publication statusPublished - Nov 19 2009
Event2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of
Duration: Jun 28 2009Jul 3 2009

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8102

Other

Other2009 IEEE International Symposium on Information Theory, ISIT 2009
CountryKorea, Republic of
CitySeoul
Period6/28/097/3/09

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Psota, E., & Perez, L. C. (2009). LDPC decoding and code design on extrinsic trees. In 2009 IEEE International Symposium on Information Theory, ISIT 2009 (pp. 2161-2165). [5205794] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205794