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 | |
| State | Published - Nov 19 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
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, 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