Title :
Connections between computation trees and graph covers
Author :
Dreher, Deanna ; Walker, Judy L.
Author_Institution :
Dept. of Math., Univ. of Nebraska-Lincoln, Lincoln, NE
Abstract :
Connections between graph cover pseudocodewords and computation tree pseudocodewords are investigated with the aim of bridging the gap between the theoretically attractive analysis of graph covers and the more intractable analysis of iterative message-passing algorithms that are intuitively linked to graph covers. Both theoretical results and numerous examples are presented.
Keywords :
decoding; iterative decoding; message passing; trees (mathematics); computation tree pseudocodeword; graph cover pseudocodeword; iterative message-passing decoder algorithm; Algorithm design and analysis; Bit error rate; Channel capacity; Geometry; Iterative algorithms; Iterative decoding; Mathematics; Parity check codes; Sum product algorithm; Tree graphs;
Conference_Titel :
Information Theory and Applications Workshop, 2009
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-3990-4
DOI :
10.1109/ITA.2009.5044971
