Explicit Matrices with the Restricted Isometry Property: Breaking the Square-Root Bottleneck
- 2.2k Downloads
Matrices with the restricted isometry property (RIP) are of particular interest in compressed sensing. To date, the best known RIP matrices are constructed using random processes, while explicit constructions are notorious for performing at the “square-root bottleneck,” i.e., they only accept sparsity levels on the order of the square root of the number of measurements. The only known explicit matrix which surpasses this bottleneck was constructed by Bourgain, Dilworth, Ford, Konyagin, and Kutzarova in Bourgain et al. (Duke Math. J. 159:145–185, 2011). This chapter provides three contributions to advance the groundbreaking work of Bourgain et al.: (i) we develop an intuition for their matrix construction and underlying proof techniques; (ii) we prove a generalized version of their main result; and (iii) we apply this more general result to maximize the extent to which their matrix construction surpasses the square-root bottleneck.
The author thanks the anonymous referees for their helpful suggestions. This work was supported by NSF Grant No. DMS-1321779. The views expressed in this chapter are those of the author and do not reflect the official policy or position of the United States Air Force, Department of Defense, or the U.S. Government.
- 6.Bourgain, J., Glibichuk, A.: Exponential sum estimate over subgroup in an arbitrary finite field. http://www.math.ias.edu/files/avi/Bourgain_Glibichuk.pdf (2011)
- 10.Casazza, P.G., Fickus, M.: Fourier transforms of finite chirps. EURASIP J. Appl. Signal Process. 2006, 7 p (2006)Google Scholar
- 14.Koiran, P., Zouzias, A.: Hidden cliques and the certification of the restricted isometry property. arXiv:1211.0665 (2012)Google Scholar
- 15.Mixon, D.G.: Deterministic RIP matrices: breaking the square-root bottleneck, short, fat matrices (weblog). http://www.dustingmixon.wordpress.com/2013/12/02/deterministic-rip-matrices-breaking-the-square-root-bottleneck/ (2013)
- 16.Mixon, D.G.: Deterministic RIP matrices: breaking the square-root bottleneck, II, short, fat matrices (weblog). http://www.dustingmixon.wordpress.com/2013/12/11/deterministic-rip-matrices-breaking-the-square-root-bottleneck-ii/ (2013)
- 17.Mixon, D.G.: Deterministic RIP matrices: breaking the square-root bottleneck, III, short, fat matrices (weblog). http://www.dustingmixon.wordpress.com/2014/01/14/deterministic-rip-matrices-breaking-the-square-root-bottleneck-iii/ (2013)
- 18.Tao, T.: Open question: deterministic UUP matrices. What’s new (weblog). http://www.terrytao.wordpress.com/2007/07/02/open-question-deterministic-uup-matrices/ (2007)