Anzeige
Erschienen in:
2007 | OriginalPaper | Buchkapitel
Iterative List Decoding of LDPC Codes
verfasst von : Tom Høholdt, Jørn Justesen
Erschienen in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In the last decade two old methods for decoding linear block codes have gained considerable interest,
iterative
decoding
as first described by Gallager in [1] and
list
decoding
as introduced by Elias [2]. In particular iterative decoding of lowdensity parity-check (LDPC) codes, has been an important subject of research, see e.g. [3] and the references therein. “Good“ LDPC codes are often randomly generated by computer, but recently codes with an algebraic or geometric structure have also been considered e.g [3] and [4]. The performance of the iterative decoder is typically studied by simulations and a theoretical analysis is more difficult.