TY - GEN

T1 - Pseudo prior belief propagation for densely connected discrete graphs

AU - Goldberger, Jacob

AU - Leshem, Amir

PY - 2010

Y1 - 2010

N2 - This paper proposes a new algorithm for the linear least squares problem where the unknown variables are constrained to be in a finite set. The factor graph that corresponds to this problem is very loopy; in fact, it is a complete bipartite graph. Hence, applying the Belief Propagation (BP) algorithm yields very poor results. The Pseudo Prior Belief Propagation (PPBP) algorithm is a variant of the BP algorithm that can achieve near maximum likelihood (ML) performance with low computational complexity. First, we use the minimum mean square error (MMSE) detection to yield a pseudo prior information on each variable. Next we integrate this information into a loopy Belief Propagation (BP) algorithm as a pseudo prior. We show that, unlike current paradigms, the Belief Propagation (BP) algorithm can be advantageous even for dense graphs with many short loops. The performance of the proposed algorithm is demonstrated on the MIMO detection problem based on simulation results.

AB - This paper proposes a new algorithm for the linear least squares problem where the unknown variables are constrained to be in a finite set. The factor graph that corresponds to this problem is very loopy; in fact, it is a complete bipartite graph. Hence, applying the Belief Propagation (BP) algorithm yields very poor results. The Pseudo Prior Belief Propagation (PPBP) algorithm is a variant of the BP algorithm that can achieve near maximum likelihood (ML) performance with low computational complexity. First, we use the minimum mean square error (MMSE) detection to yield a pseudo prior information on each variable. Next we integrate this information into a loopy Belief Propagation (BP) algorithm as a pseudo prior. We show that, unlike current paradigms, the Belief Propagation (BP) algorithm can be advantageous even for dense graphs with many short loops. The performance of the proposed algorithm is demonstrated on the MIMO detection problem based on simulation results.

UR - http://www.scopus.com/inward/record.url?scp=77954820368&partnerID=8YFLogxK

U2 - 10.1109/ITWKSPS.2010.5503198

DO - 10.1109/ITWKSPS.2010.5503198

M3 - Conference contribution

AN - SCOPUS:77954820368

SN - 9781424463725

T3 - IEEE Information Theory Workshop 2010, ITW 2010

BT - IEEE Information Theory Workshop 2010, ITW 2010

T2 - IEEE Information Theory Workshop 2010, ITW 2010

Y2 - 6 January 2010 through 8 January 2010

ER -