Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization
Vontobel, P.O.
Hewlett-Packard Labs., Palo Alto, CA;
This paper appears in: Communication, Control, and Computing, 2008 46th Annual Allerton Conference on
Publication Date: 23-26 Sept. 2008
On page(s): 1416-1416
Location: Urbana-Champaign, IL,
ISBN: 978-1-4244-2925-7
INSPEC Accession Number: 10501227
Digital Object Identifier: 10.1109/ALLERTON.2008.4797727
Current Version Published: 2009-03-04
Abstract
In the past, graph-cover decoding, here called blockwise graph-cover decoding (B-GCD), has been introduced as a theoretical tool to better understand message-passing iterative decoding, especially to better understand the connections between max-product algorithm decoding and linear programming decoding. In this paper we introduce symbolwise graph-cover decoding (S-GCD), a theoretical tool that helps to better understand the connections between sum-product algorithm decoding and Bethe free energy minimization. S-GCD motivates a deeper study of the properties of the Bethe free energy and of the pseudo-dual of the Bethe free energy, a study which allows one to re-derive and shed new light on many known results for sum-product algorithm decoding. In particular, it gives a new interpretation of a result by Yedidia, Freeman, and Weiss (namely the result that fixed points of the sum-product algorithm correspond to stationary points of the Bethe free energy), of the fundamental polytope, of stopping sets, of EXIT charts, of the Maxwell construction/decoder, and of the asymptotic growth rate of the average Hamming weight distribution of certain (protograph) code ensembles.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
