The sum-product algorithm on simple graphs

The sum-product algorithm on simple graphs

This article summarizes work in progress on theoretical analysis of the sum-product algorithm. Two families of graphs with quite different characteristics are studied: graphs in which all checks have degree two and graphs with a single cycle. Each family has a relatively simple structure that allows...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: O'Sullivan, Michael E., Brevik, John, Vargo, Shayne M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Bipartite graph
Convergence
Data structures
Electronic mail
Sum product algorithm
Transforms
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This article summarizes work in progress on theoretical analysis of the sum-product algorithm. Two families of graphs with quite different characteristics are studied: graphs in which all checks have degree two and graphs with a single cycle. Each family has a relatively simple structure that allows for precise mathematical results about the convergence of the sum-product algorithm.
DOI:10.1109/ITA.2009.5044954