pith. sign in

arxiv: 1405.2767 · v1 · pith:HVBCWHRFnew · submitted 2014-05-12 · 💻 cs.IT · math.IT

S-AMP: Approximate Message Passing for General Matrix Ensembles

classification 💻 cs.IT math.IT
keywords s-ampmatrixalgorithmapproximateensemblesfreegeneralpoints
0
0 comments X
read the original abstract

In this work we propose a novel iterative estimation algorithm for linear observation systems called S-AMP whose fixed points are the stationary points of the exact Gibbs free energy under a set of (first- and second-) moment consistency constraints in the large system limit. S-AMP extends the approximate message-passing (AMP) algorithm to general matrix ensembles. The generalization is based on the S-transform (in free probability) of the spectrum of the measurement matrix. Furthermore, we show that the optimality of S-AMP follows directly from its design rather than from solving a separate optimization problem as done for AMP.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.