LDPC decoding and code design on extrinsic trees

Eric Psota, Lance C Perez

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

5 Citations (Scopus)

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
StatePublished - 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

Decoding
Tree Algorithms
Low-density Parity-check (LDPC) Codes
Parity
Upper bound
Graph in graph theory
Design

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

LDPC decoding and code design on extrinsic trees. / Psota, Eric; Perez, Lance C.

2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 2161-2165 5205794 (IEEE International Symposium on Information Theory - Proceedings).

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

Psota, E & Perez, LC 2009, LDPC decoding and code design on extrinsic trees. in 2009 IEEE International Symposium on Information Theory, ISIT 2009., 5205794, IEEE International Symposium on Information Theory - Proceedings, pp. 2161-2165, 2009 IEEE International Symposium on Information Theory, ISIT 2009, Seoul, Korea, Republic of, 6/28/09. https://doi.org/10.1109/ISIT.2009.5205794
Psota E, Perez LC. LDPC decoding and code design on extrinsic trees. In 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. p. 2161-2165. 5205794. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2009.5205794
Psota, Eric ; Perez, Lance C. / LDPC decoding and code design on extrinsic trees. 2009 IEEE International Symposium on Information Theory, ISIT 2009. 2009. pp. 2161-2165 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{37ffee7f13f9433a8054b4a61fb5b572,
title = "LDPC decoding and code design on extrinsic trees",
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.",
author = "Eric Psota and Perez, {Lance C}",
year = "2009",
month = "11",
day = "19",
doi = "10.1109/ISIT.2009.5205794",
language = "English (US)",
isbn = "9781424443130",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "2161--2165",
booktitle = "2009 IEEE International Symposium on Information Theory, ISIT 2009",

}

TY - GEN

T1 - LDPC decoding and code design on extrinsic trees

AU - Psota, Eric

AU - Perez, Lance C

PY - 2009/11/19

Y1 - 2009/11/19

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=70449484514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70449484514&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2009.5205794

DO - 10.1109/ISIT.2009.5205794

M3 - Conference contribution

AN - SCOPUS:70449484514

SN - 9781424443130

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2161

EP - 2165

BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009

ER -