Sparse Multi-User Detection for CDMA transmission using greedy algorithms

Proceedings of the International Symposium on Wireless Communication Systems

Volumn , Issue , 2011, Pages 291-295

  Schepker, Henning F ^a   Dekorsy, Armin ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CDMA SYSTEM; CDMA TRANSMISSION; CONTROL SIGNALING; DETECTION ALGORITHM; GREEDY ALGORITHMS; JOINT DETECTION; MULTI-USER; POSSIBLE FUTURES; RANDOM ACCESS CHANNEL; SPARSE SIGNALS; SPREADING SEQUENCES; UNDER-DETERMINED; USER ACTIVITY; WIRELESS UPLINK;

DETECTORS; GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS; MULTIUSER DETECTION; SENSOR NETWORKS; SIGNAL DETECTION;

CODE DIVISION MULTIPLE ACCESS;

EID: 84857487773     PISSN: 21540217     EISSN: 21540225     Source Type: Conference Proceeding    
DOI: 10.1109/ISWCS.2011.6125356     Document Type: Conference Paper

References (18)

1. D. L. Donoho, Compressed sensing, IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289 1306, April 2006.
2. E. J. Candes, J. Romberg, and T. Tao, Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information, IEEE Transactions on Information Theory, vol. 52, no. 2, pp. 489 509, February 2006.
3. D. Angelosante, E. Grossi, G. B. Giannakis, and M. Lops, Sparsityaware estimation of CDMA system parameters, EURASIP Journal on Advances in Signal Processing, vol. 2010, pp. 1 10, April 2010.
4. C. R. Berger, Z. Wang, J. Huang, and S. Zhou, Application of compressive sensing to sparse channel estimation, IEEE Communications Magazine, vol. 48, no. 11, pp. 164 174, November 2010.
5. S. Verdu, Multiuser Detection. Cambridge, U. K.: Cambridge Univ. Press, November 1998.
6. A. Dekorsy and S. Brueck, Is multiuser detection bene cial to mixed service UMTS networks? AEU-International Journal of Electronics and Communications, vol. 59, no. 8, pp. 473 482, December 2005.
7. H. Zhu and G. B. Giannakis, Exploiting sparse user activity in multiuser detection, IEEE Transactions on Communications, vol. 59, no. 2, pp. 454 465, February 2011.
8. S. S. Chen, D. L. Donoho, and M. A. Sanders, Atomic decomposition by basis pursuit, SIAM Journal of Scienti c Computing, vol. 20, no. 1, pp. 33 61, 1998.
9. R. Tibshirani, Regression shrinkage and selection via the lasso, Journal of the Royal Statistical Society, Series B, vol. 58, no. 1, pp. 267 288, 1996.
10. Y. Pati, R. Rezaiifar, and P. Krishnaprasad, Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition, Signals, Systems and Computers, vol. 1, pp. 40 44, November 1993.
11. S. Chen, S. A. Billings, and W. Luo, Orthogonal least squares methods and their application to non-linear system identi cation, International Journal of Control, vol. 50, no. 5, pp. 1873 1896, September 1989.
12. D. Needell and J. A. Tropp, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Applied and Computational Harmonic Analysis, vol. 26, no. 3, pp. 301 321, May 2009.
13. E. J. Candes and M. B. Wakin, An introduction to compressive sampling, IEEE Signal Processing Magazine, vol. 25, no. 2, pp. 21 30, March 2008.
14. J. A. Tropp and A. C. Gilbert, Signal recovery from random measurements via orthogonal matching pursuit, IEEE Transactions on Information Theory, vol. 53, no. 12, pp. 4655 4666, December 2007.
15. D. L. Donoho, Y. Tsaig, I. Drori, and J.-L. Starck, Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit, Stanford University, Stanford, CA, USA, Tech. Rep., 2006.
16. A. Divekar and O. Ersoy, Probabilistic matching pursuit for compressive sensing, Purdue University, West Lafayette, IN, USA, Tech. Rep., May 2010.
17. J. A. Tropp, Average-case analysis of greedy pursuit, in Proc. SPIE Wavelets XI, July 2005.
18. T. Blumensath and M. E. Davies, On the difference between orthogonal matching pursuit and orthogonal least squares, University of Edinburgh, Edinburgh, Scotland, U. K., Tech. Rep., March 2007.