Fetching the paper…
Reading the bibliography…
Approximate message passing (AMP) is a low-cost iterative signal recovery algorithm for linear system models.
C. Stein, “A bound for the error in the normal approximation to the distribution,” in Proc. 6th Berkeley Symp. Math. Statist. Probab. , 1972
1972
Earlier work this paper cites.
S. M. Kay, Fundamentals of statistical signal processing: estimation theory . NJ: Prentice-Hall PTR, 1993
1993
Earlier work this paper cites.
D. Donoho, “De-noising by soft-thresholding,” IEEE Trans. Inf. Theory , vol. 41, no. 3, pp. 613–627, May 1995
1995
Earlier work this paper cites.
F. Hiai and D. Petz, Asymptotic freeness almost everywhere for random matrices . University of Aarhus. Centre for Mathematical Physics and Stochastics (MaPhySto)[MPS], 1999
1999
Earlier work this paper cites.
T. Richardson and R. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Trans. Inf. Theory , vol. 47, no. 2, pp. 599–618, Feb. 2001
2001
Earlier work this paper cites.
S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Trans. Inf. Theory , vol. 49, no. 10, pp. 1727–1737, Oct 2001
2001
Earlier work this paper cites.
H. A. Van der Vorst, Iterative Krylov methods for large linear systems . Cambridge University Press, 2003, vol. 13
2003
Earlier work this paper cites.
A. M. Tulino and S. Verdú, Random matrix theory and wireless communications . Now Publishers Inc, 2004, vol. 1
2004
Earlier work this paper cites.
D. Guo and S. Verdu, “Randomly spread CDMA: asymptotics via statistical physics,” IEEE Trans. Inf. Theory , vol. 51, no. 6, pp. 1983–2010, Jun. 2005
2005
Earlier work this paper cites.
M. Lustig, D. L. Donoho, J. M. Santos, and J. M. Pauly, “Compressed sensing MRI,” IEEE Signal Process. Mag. , vol. 25, no. 2, pp. 72–82, March 2008
2008
Earlier work this paper cites.
D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” in Proc. Nat. Acad. Sci. , vol. 106, no. 45, Nov. 2009
2009
Earlier work this paper cites.
S. Rangan, V. Goyal, and A. K. Fletcher, “Asymptotic analysis of MAP estimation via the replica method and compressed sensing,” in Advances in Neural Information Processing Systems , 2009, pp. 1545–1553
2009
Earlier work this paper cites.
D. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing: I. motivation and construction,” in Information Theory (ITW 2010, Cairo), 2010 IEEE Information Theory Workshop on , Jan 2010, pp. 1–5
2010
Earlier work this paper cites.
2010
Earlier work this paper cites.
M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Trans. Inf. Theory , vol. 57, no. 2, pp. 764–785, Feb. 2011
2011
Earlier work this paper cites.
D. Guo, Y. Wu, S. Shamai, and S. Verdu, “Estimation in Gaussian noise: properties of the minimum mean-square error,” IEEE Trans. Inf. Theory , vol. 57, no. 4, pp. 2371–2385, Apr. 2011
2011
Cited alongside, same era.
A. Tulino, G. Caire, S. Verdu, and S. Shamai, “Support recovery with sparsely sampled free random matrices,” IEEE Trans. Inf. Theory , vol. 59, no. 7, pp. 4243–4271, Jul. 2013
2013
Cited alongside, same era.
J. Vila and P. Schniter, “Expectation-maximization Gaussian-mixture approximate message passing,” IEEE Trans. Signal Process. , vol. 61, no. 19, pp. 4658–4672, Oct. 2013
2013
Cited alongside, same era.
D. Donoho, I. Johnstone, and A. Montanari, “Accurate prediction of phase transitions in compressed sensing via a connection to minimax denoising,” IEEE Trans. Inf. Theory , vol. 59, no. 6, pp. 3396–3433, June 2013
2013
Cited alongside, same era.
2015
Later among the works it cites.
2015
Later among the works it cites.
E. Bostan, M. Unser, and J. P. Ward, “Divergence-free wavelet frames,” IEEE Signal Process. Lett. , vol. 22, no. 8, pp. 1142–1146, 2015
2015
Later among the works it cites.
J. Ma, X. Yuan, and L. Ping, “Turbo compressed sensing with partial DFT sensing matrix,” IEEE Signal Process. Lett. , vol. 22, no. 2, pp. 158–161, Feb. 2015
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
S. Wu, L. Kuang, Z. Ni, J. Lu, D. Huang, and Q. Guo, “Low-complexity iterative detection for large-scale multiuser MIMO-OFDM systems using approximate message passing,” IEEE J. Sel. Topics Signal Process. , vol. 8, no. 5, pp. 902–915, Oct 2014
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Y. Kabashima and M. Vehkapera, “Signal recovery using expectation consistent approximation for linear observations,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2014, pp. 226–230
2014
Cited alongside, same era.
B. Cakmak, O. Winther, and B. Fleury, “S-AMP: Approximate message passing for general matrix ensembles,” in Information Theory Workshop (ITW), 2014 IEEE , Nov. 2014, pp. 192–196
2014
Cited alongside, same era.
X. Yuan, J. Ma, and L. Ping, “Energy-spreading-transform based MIMO systems: Iterative equalization, evolution analysis, and precoder optimization,” IEEE Trans. Wireless Commun. , vol. 13, no. 9, pp. 5237–5250, Sept. 2014
2014
Cited alongside, same era.
M. Vehkapera, Y. Kabashima, and S. Chatterjee, “Analysis of regularized LS reconstruction and random matrix ensembles in compressed sensing,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , Jun. 2014, pp. 3185–3189
2014
Cited alongside, same era.
M. Bayati, M. Lelarge, A. Montanari et al. , “Universality in polytope phase transitions and message passing algorithms,” The Annals of Applied Probability , vol. 25, no. 2, pp. 753–822, 2015
2015
Cited alongside, same era.
2015
Later among the works it cites.
J. Ma, X. Yuan, and L. Ping, “On the performance of turbo signal recovery with partial DFT sensing matrices,” IEEE Signal Process. Lett. , vol. 22, no. 10, pp. 1580–1584, Oct 2015
2015
Later among the works it cites.
2016
Closest in time.
M. Opper, B. Cakmak, and O. Winther, “A theory of solving TAP equations for ising models with general invariant random matrices,” Journal of Physics A: Mathematical and Theoretical , vol. 49, no. 11, p. 114002, 2016
2016
Closest in time.
J. Ma and L. Ping, “Orthogonal AMP,” arXiv preprint arXiv:1602.06509 , 2016
2016
Closest in time.
2016
Closest in time.
J. Ma and L. Ping, “Orthogonal AMP for compressed sensing with unitarily-invariant matrices,” in 2016 IEEE Information Theory Workshop (ITW) , Sept 2016, pp. 280–284
2016
Closest in time.
2016
Closest in time.
C. Rush, A. Greig, and R. Venkataramanan, “Capacity-achieving sparse regression codes via approximate message passing decoding,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT) , June 2015, pp. 2016–2020
2020
Closest in time.
J. Vila, P. Schniter, S. Rangan, F. Krzakala, and L. Zdeborová, “Adaptive damping and mean removal for the generalized approximate message passing algorithm,” in Acoustics, Speech and Signal Processing (ICASSP), 2015 IEEE International Conference on , 2015, pp. 2021–2025
2025
Closest in time.