Three Dimensional Sums of Character Gabor Systems

09/25/2019
by   Kung-Ching Lin, et al.
0

In deterministic compressive sensing, one constructs sampling matrices that recover sparse signals from highly incomplete measurements. However, the so-called square-root bottleneck limits the usefulness of such matrices, as they are only able to recover exceedingly sparse signals with respect to the matrix dimension. In view of the flat restricted isometry property (flat RIP) proposed by Bourgain et al., we provide a partial solution to the bottleneck problem with the Gabor system of Legendre symbols. When summing over consecutive vectors, the estimate gives a nontrivial upper bound required for the bottleneck problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/21/2020

On Compressed Sensing Matrices Breaking the Square-Root Bottleneck

Compressed sensing is a celebrated framework in signal processing and ha...
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
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
07/12/2022

Deriving RIP sensing matrices for sparsifying dictionaries

Compressive sensing involves the inversion of a mapping SD ∈ℝ^m × n, whe...
research
05/29/2018

Explicit construction of RIP matrices is Ramsey-hard

Matrices Φ∈^n× p satisfying the Restricted Isometry Property (RIP) are a...
research
06/24/2021

Johnson-Lindenstrauss Embeddings with Kronecker Structure

We prove the Johnson-Lindenstrauss property for matrices Φ D_ξ where Φ h...

Please sign up or login with your details

Forgot password? Click here to reset