Performance limits of Matching Pursuit algorithms

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2008, Pages 2444-2448

  Jin, Yuzhe ^a   Rao, Bhaskar D ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATIONS; INTERNATIONAL SYMPOSIUM; MATCHING PURSUIT ALGORITHMS; MULTIPLE-ACCESS CHANNEL; ORTHOGONAL MATCHING PURSUIT; OVERCOMPLETE REPRESENTATIONS; PERFORMANCE LIMITATIONS; PERFORMANCE LIMITS; SPARSE SOLUTIONS; SUCCESSIVE INTERFERENCE CANCELLATION; WIRELESS COMMUNICATION;

COMMUNICATION; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CYBERNETICS; INFORMATION THEORY; INVERSE PROBLEMS; SILICON CARBIDE; SOLUTIONS; TECHNICAL PRESENTATIONS; TELECOMMUNICATION; WAVE INTERFERENCE;

DECODING;

EID: 52349089568     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2008.4595430     Document Type: Conference Paper

References (19)

1. 1-norm solution is also the sparsest solution," Preprint, 2004.
2. E. J. Candes, J. K. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Comm. Pure Appl. Math, 2006.
3. J. A. Tropp, "Greedy is good: Algorithmic results for sparse approximation," IEEE Trans. Info. Theo., 2004.
4. M. Wainwright, "Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting," Proc. Int'l. Symp. Info. Theo., June 2007.
5. S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado, "Sparse solutions to linear inverse problems with multiple measurement vectors," IEEE Trans. Sig. Proc., 2005.
6. S. Sarvotham, D. Baron, and R. G. Baraniuk, "Measurements vs. bits: Compressed sensing meets information theory," Proceedings of 44th Allerton Conf. Comm., Ctrl., Computing, 2006.
7. E. J. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Inform. Theory, vol. 51, no. 12, pp. 4203-4215, 2005.
8. 1-norm near-solution is also the sparsest nearsolution," Preprint, 2004.
9. J.A. Tropp and A. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Info. Theo. preprint, 2007.
10. D. Wipf and B. D. Rao, "An empirical bayesian strategy for solving the simultaneous sparse approximation problem," IEEE Trans. Sig. Proc., vol. 55, no. 7, pp. 3704-3716, 2007.
11. Y. Jin and B. D. Rao, "Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory," ICASSP, 2008.
12. A. C. Gilbert and J. A. Tropp, "Applications of sparse approximations in communications," IS IT, 2005.
13. G. Karabulut, T. Kurt, and A. Yongaçog̃lu, "Blind estimation and multiuser detection for wireless cdma systems," IEEE ICC, pp. 4953-4958, 2006.
14. D. Tse and P. Viswanath, Fundamentals of Wireless Communication, Cambridge University Press, 2005.
15. D. Donoho, Y. Tsaig, I. Drori, and J. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," preprint, 2006.
16. D. Wipf, "Bayesian methods for finding sparse representations," Ph.D. dissertation, Univ. Calif., San Diego, 2006.
17. D. Wipf and B. D. Rao, "Comparing the effects of different weight distributions on finding sparse representations," NIPS, 2006.
18. E. J. Candes, 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, 2006.
19. E. J. Candes and T. Tao, "Near-optimal signal recovery from random projections and universal encoding strategies," IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5406-5425, 2006.