LDPC decoding and code design on extrinsic trees

Authors:
Eric Psota;Lance C. Pérez
Affiliations:
Department of Electrical Engineering, University of Nebraska-Lincoln, Lincoln, Nebraska;Department of Electrical Engineering, University of Nebraska-Lincoln, Lincoln, Nebraska
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 3
Cited 1

Analysis of connections between pseudocodewords

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory

The manifestation of stopping sets and absorbing sets as deviations on the computation trees of LDPC codes

Journal of Electrical and Computer Engineering - Special issue on iterative signal processing in communications

Quantified Score

Hi-index	0.00

Visualization

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.