DocumentCode
1890763
Title
Extrinsic tree decoding
Author
Psota, Eric ; Pérez, Lance C.
Author_Institution
Dept. of Electr. Eng., Univ. of Nebraska-Lincoln, Lincoln, NE
fYear
2009
fDate
18-20 March 2009
Firstpage
406
Lastpage
410
Abstract
A new decoding method, called extrinsic tree decoding, is presented for decoding low-density parity-check codes on modified finite computation trees. The proposed method maintains similar performance to that of existing iterative decoders, while providing a decoding method for which realistic upper bounds can be computed for practical codes.
Keywords
iterative decoding; parity check codes; trees (mathematics); extrinsic tree decoding; iterative decoders; low-density parity-check codes; modified finite computation trees; Additive white noise; Computational modeling; Costs; Iterative decoding; Iterative methods; Parity check codes; Performance analysis; Sum product algorithm; Tree graphs; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Sciences and Systems, 2009. CISS 2009. 43rd Annual Conference on
Conference_Location
Baltimore, MD
Print_ISBN
978-1-4244-2733-8
Electronic_ISBN
978-1-4244-2734-5
Type
conf
DOI
10.1109/CISS.2009.5054754
Filename
5054754
Link To Document