Fetching the paper…
Reading the bibliography…
We study the problem of recovering an $n$-dimensional vector of $\{\pm1\}^n$ (BPSK) signals from $m$ noise corrupted measurements $\mathbf{y}=\mathbf{A}\mathbf{x}_0+\mathbf{z}$.
P. K. Andersen and R. D. Gill, “Cox’s regression model for counting processes: a large sample study,” The annals of statistics , pp. 1100–1120, 1982
1982
Earlier work this paper cites.
Y. Gordon, “Some inequalities for gaussian processes and applications,” Israel Journal of Mathematics , vol. 50, no. 4, pp. 265–289, 1985
1985
Earlier work this paper cites.
Y. Gordon, On Milman’s inequality and random subspaces which escape through a mesh in ℝ n \mathbb{R}^{n} . Springer, 1988
1988
Earlier work this paper cites.
M. Ledoux and M. Talagrand, Probability in Banach Spaces: isoperimetry and processes . Springer, 1991, vol. 23
1991
Earlier work this paper cites.
W. K. Newey and D. McFadden, “Large sample estimation and hypothesis testing,” Handbook of econometrics , vol. 4, pp. 2111–2245, 1994
1994
Earlier work this paper cites.
G. J. Foschini, “Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas,” Bell labs technical journal , vol. 1, no. 2, pp. 41–59, 1996
1996
Earlier work this paper cites.
S. Verdu, Multiuser detection . Cambridge university press, 1998
1998
Earlier work this paper cites.
B. Hassibi and H. Vikalo, “On the sphere-decoding algorithm i. expected complexity,” Signal Processing, IEEE Transactions on , vol. 53, no. 8, pp. 2806–2818, 2005
2005
Cited alongside, same era.
S. Boyd and L. Vandenberghe, Convex optimization . Cambridge university press, 2009
2009
Cited alongside, same era.
M. Grötschel, L. Lovász, and A. Schrijver, Geometric algorithms and combinatorial optimization . Springer Science & Business Media, 2012, vol. 2
2012
Cited alongside, same era.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Cited alongside, same era.
H. Q. Ngo, E. G. Larsson, and T. L. Marzetta, “Energy and spectral efficiency of very large multiuser mimo systems,” Communications, IEEE Transactions on , vol. 61, no. 4, pp. 1436–1449, 2013
C.-K. Wen, J.-C. Chen, K.-K. Wong, and P. Ting, “Message passing algorithm for distributed downlink regularized zero-forcing beamforming with cooperative base stations,” Wireless Communications, IEEE Transactions on , vol. 13, no. 5, pp. 2920–2930, 2014
2014
Later among the works it cites.
T. L. Narasimhan and A. Chockalingam, “Channel hardening-exploiting message passing (chemp) receiver in large-scale mimo systems,” Selected Topics in Signal Processing, IEEE Journal of , vol. 8, no. 5, pp. 847–860, 2014
2014
Later among the works it cites.
J. Charles, G. Ramina, M. Arian, and S. Christoph, “Optimality of large mimo detection via approximate message passing,” in Information Theory (ISIT), 2015 IEEE International Symposium on . IEEE, 2015
2015
Closest in time.
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2013
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
Closest in time.
C. Thrampoulidis, S. Oymak, and B. Hassibi, “Regularized linear regression: A precise analysis of the estimation error,” in Proceedings of The 28th Conference on Learning Theory , 2015, pp. 1683–1709
2015
Closest in time.
2015
Closest in time.
C. Thrampoulidis, E. Abbasi, and B. Hassibi, “Precise high-dimensional error analysis of regularized m-estimators under gaussian measurement designs,” in Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on . IEEE, 2015
2015
Closest in time.