Show simple item record

dc.contributor.authorMoon, Todd K.
dc.contributor.authorGunther, Jacob H.
dc.date.accessioned2016-04-29T17:51:05Zen
dc.date.available2016-04-29T17:51:05Zen
dc.date.issued2003-10en
dc.identifier.issn0884-5123en
dc.identifier.issn0074-9079en
dc.identifier.urihttp://hdl.handle.net/10150/607470en
dc.descriptionInternational Telemetering Conference Proceedings / October 20-23, 2003 / Riviera Hotel and Convention Center, Las Vegas, Nevadaen_US
dc.description.abstractLow-Density Parity-Check (LDPC) codes are powerful codes capable of nearly achieving the Shannon channel capacity. This paper presents a tutorial introduction to LDPC codes, with a detailed description of the decoding algorithm. The algorithm propagates information about bit and check probabilities through a tree obtained from the Tanner graph for the code. This paper may be useful as a supplement in a course on error-control coding or digital communication.
dc.description.sponsorshipInternational Foundation for Telemeteringen
dc.language.isoen_USen
dc.publisherInternational Foundation for Telemeteringen
dc.relation.urlhttp://www.telemetry.org/en
dc.rightsCopyright © International Foundation for Telemeteringen
dc.subjectError correction codingen
dc.subjectiterative decodingen
dc.subjectchannel capacityen
dc.subjectparity-check codesen
dc.titleAN INTRODUCTION TO LOW-DENSITY PARITY-CHECK CODESen_US
dc.typetexten
dc.typeProceedingsen
dc.contributor.departmentUtah State Universityen
dc.identifier.journalInternational Telemetering Conference Proceedingsen
dc.description.collectioninformationProceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection.en
refterms.dateFOA2018-06-24T18:38:38Z
html.description.abstractLow-Density Parity-Check (LDPC) codes are powerful codes capable of nearly achieving the Shannon channel capacity. This paper presents a tutorial introduction to LDPC codes, with a detailed description of the decoding algorithm. The algorithm propagates information about bit and check probabilities through a tree obtained from the Tanner graph for the code. This paper may be useful as a supplement in a course on error-control coding or digital communication.


Files in this item

Thumbnail
Name:
ITC_2003_03-31-01.pdf
Size:
186.3Kb
Format:
PDF

This item appears in the following Collection(s)

Show simple item record