On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions

Details On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions

2011-05-30

arxiv.org/abs/1105.6138v1

Mathematics

Numerical Analysis

Scientific paper

We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing specialized matrices from this class which are sparse when multiplied with a discrete Fourier transform matrix. Ultimately, these considerations improve previous sampling requirements for deterministic sparse Fourier transform methods.

Affiliated with

Also associated with

No associations

Rating

On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337342