Skip to content

Explicit matrices with the restricted isometry property: Breaking the square-root bottleneck

14Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Mixon, D. G. (2015). Explicit matrices with the restricted isometry property: Breaking the square-root bottleneck. In Applied and Numerical Harmonic Analysis (pp. 389–417). Springer International Publishing. https://doi.org/10.1007/978-3-319-16042-9_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free