Gaussian Belief Propagation Solver for Systems of Linear Equations

Simple item page
dc.creatorShental, Ori
dc.creatorSiegel, Paul H.
dc.creatorWolf, Jack K.
dc.creatorBickson, Danny
dc.creatorDolev, Danny
dc.date2008-10-09
dc.date.accessioned2026-07-07T13:04:05Z
dc.date.available2026-07-07T13:04:05Z
dc.descriptionThe canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we develop a solution based upon Gaussian belief propagation (GaBP) that does not involve direct matrix inversion. The iterative nature of our approach allows for a distributed message-passing implementation of the solution algorithm. We also address some properties of the GaBP solver, including convergence, exactness, its max-product version and relation to classical solution methods. The application example of decorrelation in CDMA is used to demonstrate the faster convergence rate of the proposed solver in comparison to conventional linear-algebraic iterative solution methods.
dc.description5 pages, 2 figures, appeared in the 2008 IEEE International Symposium on Information Theory, Toronto, July 2008
dc.identifierhttps://arxiv.org/abs/0810.1736
dc.identifierhttp://arxiv.org/abs/0810.1736
dc.identifierThe 2008 IEEE International Symposium on Information Theory (ISIT 2008), Toronto, July 2008
dc.identifierdoi:10.1109/ISIT.2008.4595311
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/227034
dc.subjectInformation Theory
dc.subjectE.5
dc.titleGaussian Belief Propagation Solver for Systems of Linear Equations
dc.typetext

Files

Collections

arXiv