Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2013 (2013), Article ID 715848, 6 pages
http://dx.doi.org/10.1155/2013/715848
Research Article

Exact CS Reconstruction Condition of Undersampled Spectrum-Sparse Signals

1Institute of Information and Navigation, Air Force Engineering University, Xi’an 710077, China
2Key Laboratory for Information Science of Electromagnetic Waves, Ministry of Education, Fudan University, Shanghai 200433, China
3Institute of Science, Air Force Engineering University, Xi’an 710051, China

Received 15 August 2013; Accepted 18 November 2013

Academic Editor: Feng Gao

Copyright © 2013 Ying Luo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. L. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory, vol. 52, no. 4, pp. 1289–1306, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. E. J. Candès, 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, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. E. J. Candès and T. Tao, “Near-optimal signal recovery from random projections: universal encoding strategies?” IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5406–5425, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  4. R. Baraniuk and P. Steeghs, “Compressive radar imaging,” in IEEE Radar Conference, pp. 128–133, Boston, Mass, USA, 2007.
  5. M. A. T. Figueiredo, R. D. Nowak, and S. J. Wright, “Gradient projection for sparse reconstruction: application to compressed sensing and other inverse problems,” IEEE Journal of Selected Topics in Signal Processing, vol. 1, no. 4, pp. 586–597, 2007. View at Google Scholar
  6. Y. Zhang, “Theory of compressive sensing via 1-minimization: a non-RIP analysis and extensions,” Journal of the Operations Research Society of China, vol. 1, no. 1, pp. 79–105, 2013. View at Google Scholar
  7. T. Strohmer, “Measure what should be measured: progress and challenges in compressive sensing,” IEEE Signal Processing Letters, vol. 19, no. 12, pp. 887–893, 2012. View at Google Scholar
  8. B. Adcock, A. C. Hansen, E. Herrholz, and G. Teschke, “Generalized sampling: extension to frames and inverse and ill-posed problems,” Inverse Problems, vol. 29, no. 1, Article ID 015008, p. 27, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. E. J. Candès and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory, vol. 51, no. 12, pp. 4203–4215, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. R. Baraniuk, M. Davenport, R. DeVore, and M. Wakin, “A simple proof of the restricted isometry property for random matrices,” Constructive Approximation, vol. 28, no. 3, pp. 253–263, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  11. Y. Luo, Q. Zhang, W. Hong, and Y.-R. Wu, “Waveform design and high-resolution imaging of cognitive radar based on compressive sensing,” Science China Information Sciences, vol. 55, no. 11, pp. 2590–2603, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. 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, 2007. View at Publisher · View at Google Scholar · View at MathSciNet