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 -