Fetching the paper…
Reading the bibliography…
This paper considers a simple on-off random multiple access channel, where n users communicate simultaneously to a single receiver over m degrees of freedom.
1963
Earlier work this paper cites.
R. Ahlswede, “Multi-way communication channels,” in Proc. IEEE Int. Symp. Inform. Th. , Armenian S.S.R., Sep. 1971, pp. 23–52
1971
Earlier work this paper cites.
S. Verdú, “Minimum probability of error for asynchronous gaussian multiple-access channel,” IEEE Trans. Inform. Theory , vol. 32, no. 1, pp. 85–96, Jan. 1986
1986
Earlier work this paper cites.
S. Chen, S. A. Billings, and W. Luo, “Orthogonal least squares methods and their application to non-linear system identification,” Int. J. Control , vol. 50, no. 5, pp. 1873–1896, Nov. 1989
1989
Earlier work this paper cites.
R. Lupas and S. Verdú, “Near-far resistance of multiuser detectors in asynchronous channels,” IEEE Trans. Comm. , vol. 38, no. 4, pp. 496–508, Apr. 1990
1990
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory . New York: John Wiley & Sons, 1991
1991
Earlier work this paper cites.
S. G. Mallat and Z. Zhang, “Matching pursuits with time-frequency dictionaries,” IEEE Trans. Signal Process. , vol. 41, no. 12, pp. 3397–3415, Dec. 1993
1993
Earlier work this paper cites.
Y. C. Pati, R. Rezaiifar, and P. S. Krishnaprasad, “Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition,” in Conf. Rec. 27th Asilomar Conf. Sig., Sys., & Comput. , vol. 1, Pacific Grove, CA, Nov. 1993, pp. 40–44
1993
Earlier work this paper cites.
G. Davis, S. Mallat, and Z. Zhang, “Adaptive time-frequency decomposition,” Optical Eng. , vol. 37, no. 7, pp. 2183–2191, Jul. 1994
1994
Earlier work this paper cites.
M. Honig, U. Madhow, and S. Verdú, “Blind adaptive multiuser detection,” IEEE Trans. Inform. Theory , vol. 41, no. 4, pp. 944–960, Jul. 1995
1995
Earlier work this paper cites.
B. K. Natarajan, “Sparse approximate solutions to linear systems,” SIAM J. Computing , vol. 24, no. 2, pp. 227–234, Apr. 1995
1995
Earlier work this paper cites.
R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. Royal Stat. Soc., Ser. B , vol. 58, no. 1, pp. 267–288, 1996
1996
Earlier work this paper cites.
S. Verdú and S. Shamai, “Spectral efficiency of CDMA with random spreading,” IEEE Trans. Inform. Theory , vol. 45, no. 3, pp. 622–640, Mar. 1999
1999
Earlier work this paper cites.
D. Tse and S. Hanly, “Linear multiuser receivers: Effective interference, effective bandwidth and capacity,” IEEE Trans. Inform. Theory , vol. 45, no. 3, pp. 641–675, Mar. 1999
1999
Cited alongside, same era.
S. S. Chen, D. L. Donoho, and M. A. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Sci. Comp. , vol. 20, no. 1, pp. 33–61, 1999
1999
Cited alongside, same era.
P. Bender, P. Black, M. Grob, R. Padovani, N. Sindhushyana, and S. Viterbi, “CDMA/HDR: A bandwidth efficient high speed wireless data service for nomadic users,” IEEE Comm. Mag. , vol. 38, no. 7, pp. 70–77, Jul. 2000
2000
Cited alongside, same era.
M. Evans, N. Hastings, and J. B. Peacock, Statistical Distributions , 3rd ed. New York: John Wiley & Sons, 2000
2000
Cited alongside, same era.
L. Qiu, Y. Huang, and J. Zhu, “Fast acquisition scheme and implementation of PRACH in WCDMA system,” in Proc. IEEE Veh. Tech. Conf. , Atlantic City, NJ, Oct. 2001, pp. 1701–1705
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory , vol. 52, no. 2, pp. 489–509, Feb. 2006
2006
Later among the works it cites.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006
2006
Later among the works it cites.
E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inform. Theory , vol. 52, no. 12, pp. 5406–5425, Dec. 2006
2006
Later among the works it cites.
M. J. Wainwright, “Sharp thresholds for high-dimensional and noisy recovery of sparsity,” Univ. of California, Berkeley, Dept. of Statistics, Tech. Rep., May 2006, arXiv:math.ST/0605740 v1 30 May 2006
2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2001
Cited alongside, same era.
M. Tipping, “Sparse Bayesian learning and the relevance vector machine,” J. Machine Learning Research , vol. 1, pp. 211–244, Sep. 2001
2001
Cited alongside, same era.
E. Callaway, P. Gorday, L. Hester, J. Gutierrez, M. Naeve, B. Heile, and V. Bahl, “Home networking with IEEE 802.15.4: A developing standard for low-rate wireless personal area networks,” IEEE Comm. Mag. , vol. 40, no. 8, pp. 70–77, Aug. 2002
2002
Cited alongside, same era.
A. Miller, Subset Selection in Regression , 2nd ed., ser. Monographs on Statistics and Applied Probability. New York: Chapman & Hall/CRC, 2002, no. 95
2002
Cited alongside, same era.
D. Wipf and B. Rao, “Sparse Bayesian learning for basis selection,” IEEE Trans. Signal Process. , vol. 52, no. 8, pp. 2153–2164, Aug. 2004
2004
Cited alongside, same era.
J. G. Andrews, “Interference cancellation for cellular systems: A contemporary overview,” IEEE Wireless Comm. , vol. 12, no. 2, pp. 19–29, Apr. 2005
2005
Cited alongside, same era.
M. F. Duarte, S. Sarvotham, D. Baron, W. B. Wakin, and R. G. Baraniuk, “Distributed compressed sensing of jointly sparse signals,” in Conf. Rec. Asilomar Conf. on Sig., Sys. & Computers , Pacific Grove, CA, Nov. 2005
2005
Cited alongside, same era.
A. Agrawal, J. G. Andrews, J. M. Cioffi, and T. Meng, “Iterative power control for imperfect successive interference cancellation,” IEEE Trans. Wireless Comm. , vol. 4, no. 3, pp. 878–884, May 2005
2005
Cited alongside, same era.
D. Wipf and B. Rao, “Comparing the effects of different weight distributions on finding sparse representations,” in Proc. Neural Information Process. Syst. , Vancouver, Canada, Dec. 2006
2006
Later among the works it cites.
A. K. Fletcher, S. Rangan, V. K. Goyal, and K. Ramchandran, “Denoising by sparse approximation: Error bounds based on rate–distortion theory,” EURASIP J. Appl. Sig. Process. , vol. 2006, pp. 1–19, Mar. 2006
2006
Later among the works it cites.
M. J. Wainwright, “Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting,” Univ. of California, Berkeley, Dept. of Statistics, Tech. Rep. 725, Jan. 2007
2007
Later among the works it cites.
J. A. Tropp and A. C. Gilbert, “Signal recovery from random measurements via orthogonal matching pursuit,” IEEE Trans. Inform. Theory , vol. 53, no. 12, pp. 4655–4666, Dec. 2007
2007
Later among the works it cites.
2008
Later among the works it cites.
2008
Later among the works it cites.
H. Rauhut, K. Schnass, and P. Vandergheynst, “Compressed sensing and redundant dictionaries,” IEEE Trans. Inform. Theory , vol. 54, no. 5, pp. 2210–2219, May 2008
2008
Later among the works it cites.
Y. Jin and B. Rao, “Performance limits of matching pursuit algorithms,” in Proc. IEEE Int. Symp. Inform. Th. , Toronto, Canada, Jun. 2008, pp. 2444–2448
2008
Later among the works it cites.
P. Schniter, L. C. Potter, and J. Ziniel, “Fast Bayesian matching pursuit: Model uncertainty and parameter estimation for sparse linear models,” IEEE Trans. Signal Process. , Aug. 2008, submitted
2008
Later among the works it cites.