LDPC decoding and code design on extrinsic trees

Eric Psota; Lance C. Pérez

doi:10.1109/ISIT.2009.5205794

LDPC decoding and code design on extrinsic trees

Eric Psota, Lance C. Pérez

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	2009 IEEE International Symposium on Information Theory, ISIT 2009
Pages	2161-2165
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2009.5205794
State	Published - 2009
Event	2009 IEEE International Symposium on Information Theory, ISIT 2009 - Seoul, Korea, Republic of Duration: Jun 28 2009 → Jul 3 2009

Publication series

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

Other

Other	2009 IEEE International Symposium on Information Theory, ISIT 2009
Country	Korea, Republic of
City	Seoul
Period	6/28/09 → 7/3/09

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2009.5205794

Fingerprint Dive into the research topics of 'LDPC decoding and code design on extrinsic trees'. Together they form a unique fingerprint.

Cite this

Psota, E & Pérez, 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

@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 P{\'e}rez, {Lance C.}",

year = "2009",

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",

note = "2009 IEEE International Symposium on Information Theory, ISIT 2009 ; Conference date: 28-06-2009 Through 03-07-2009",

}

TY - GEN

T1 - LDPC decoding and code design on extrinsic trees

AU - Psota, Eric

AU - Pérez, Lance C.

PY - 2009

Y1 - 2009

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

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

Y2 - 28 June 2009 through 3 July 2009

ER -