Simple deterministically constructible rip matrices with sublinear fourier sampling requirements

Proceedings - 43rd Annual Conference on Information Sciences and Systems, CISS 2009

Volumn , Issue , 2009, Pages 870-875

  Iwen, M A ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Algorithms; Discrete fourier transforms; Fourier transforms; Number theory; Signal processing

Indexed keywords

EXPLICIT BOUNDS; FOURIER; FOURIER SAMPLING; INPUT VECTOR; PERIODIC FUNCTION; SAMPLE SETS; SECOND DERIVATIVES; SINGLE PERIOD; SPARSE MATRICES; SUBLINEAR;

BLOCK CODES; INFORMATION SCIENCE; MATHEMATICAL TRANSFORMATIONS; MATRIX ALGEBRA; NUMBER THEORY; PROBABILITY DENSITY FUNCTION; SAMPLING; SET THEORY; SIGNAL PROCESSING;

DISCRETE FOURIER TRANSFORMS;

EID: 70349684905     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2009.5054839     Document Type: Conference Paper

References (19)

1. M. A. Iwen, "A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods," in Proc. of ACM-SIAM symposium on Discrete algorithms (SODA'08), 2008.
2. M. A. Iwen, "Combinatorial sublinear-time fourier algorithms," Submitted. Available at http://www.ima.umn.edu/~iwen/index.html, 2008.
3. Emmanuel Candes and Terence Tao, "Near optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. on Information Theory, 2006.
4. R. DeVore, "Deterministic Constructions of Compressed Sensing Matrices," http://www.dsp.ece.rice.edu/cs/Henryk.pdf, Preprint 2007.
5. R. Berinde, A. C. Gilbert, P. Indyk, H. Karloff, and M.J. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery," preprint, 2008.
6. Mark Rudelson and Roman Vershynin, "Sparse reconstruction by convex relaxation: Fourier and gaussian measurements," in 40th Annual Conference on Information Sciences and Systems (CISS), 2006.
7. D. Needell and J. A. Tropp, "Cosamp: Iterative signal recovery from incomplete and inaccurate samples," preprint, 2008.
8. Stefan Kunis and Holger Rauhut, "Random Sampling of Sparse Trigonometric Polynomials II - Orthogonal Matching Pursuit versus Basis Pursuit," Foundations of Computational Mathematics, to appear.
9. D. Needell and R. Vershynin, "Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit," submitted, 2007.
10. J. P. Boyd, Chebyshev and Fourier Spectral Methods, Dover Publications, Inc., 2001.
11. Ivan Niven, Herbert S. Zuckerman, and Hugh L. Montgomery, An Introduction to The Theory of Numbers, John Wiley & Sons, Inc., 1991.
12. "The Prime Pages," http://primes.utm.edu/.
13. M. A. Iwen and C. V. Spencer, "Improved bounds for a deterministic sublinear-time sparse fourier algorithm," in Conference on Information Sciences and Systems (CISS), 2008.
14. th prime is greater than k(lnk + In k: - 1) for k ≥ 2," Mathematics of Computation, vol. 68, no. 225, 1999.
15. Venkat Chandar, "A negative result concerning explicit matrices with the restricted isometry property," Preprint, 2008.
16. David L. Donoho and Jared Tanner, "Thresholds for the recovery of sparse solutions via 11 minimization," in 40th Annual Conference on Information Sciences and Systems (CISS), 2006.
17. L.R. Rabiner, R.W. Schafer, and C.M. Rader, "The Chirp z-Transform Algorithm," IEEE Transactions on Audio and Electroacoustics, vol. AU-17, no. 2, pp. 86-92, June 1969.
18. David Kincaid and Ward Cheney, Numerical Analysis: Mathematics of Scientific Computing, China Machine Press, 2003.
19. A. Gilbert, S. Muthukrishnan, and M. Strauss, "Improved time bounds for near-optimal sparse Fourier representations," SPIE, 2005.