Improved Lower Bounds for the Restricted Isometry Property of Subsampled Fourier Matrices

03/28/2019
by   Shravas Rao, et al.
0

Let A be an N × N Fourier matrix over F_p^N/p for some prime p. We improve upon known lower bounds for the number of rows of A that must be sampled so that the resulting matrix M satisfies the restricted isometry property for k-sparse vectors. This property states that Mv_2^2 is approximately v_2^2 for all k-sparse vectors v. In particular, if k = Ω( ^2N), we show that Ω(kkN/p) rows must be sampled to satisfy the restricted isometry property with constant probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2019

Sparse Reconstruction from Hadamard Matrices: A Lower Bound

We give a short argument that yields a new lower bound on the number of ...
research
03/28/2019

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices

We give a short argument that yields a new lower bound on the number of ...
research
06/28/2018

Truncated Sparse Approximation Property and Truncated q-Norm Minimization

This paper considers approximately sparse signal and low-rank matrix's r...
research
10/19/2020

On the restricted isometry property of the Paley matrix

In this paper, we prove that the Paley graph conjecture implies that the...
research
09/21/2021

Modewise Operators, the Tensor Restricted Isometry Property, and Low-Rank Tensor Recovery

Recovery of sparse vectors and low-rank matrices from a small number of ...
research
06/28/2017

Generalized notions of sparsity and restricted isometry property. Part II: Applications

The restricted isometry property (RIP) is a universal tool for data reco...
research
08/12/2023

Effective Bounds for Restricted 3-Arithmetic Progressions in 𝔽_p^n

For a prime p, a restricted arithmetic progression in 𝔽_p^n is a triplet...

Please sign up or login with your details

Forgot password? Click here to reset