z-logo
open-access-imgOpen Access
A variant of compressed sensing
Author(s) -
Basarab Mateï,
Yves Meyer
Publication year - 2009
Publication title -
revista matemática iberoamericana
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.569
H-Index - 52
eISSN - 2235-0616
pISSN - 0213-2230
DOI - 10.4171/rmi/578
Subject(s) - nyquist–shannon sampling theorem , compressed sensing , bridging (networking) , sampling (signal processing) , computer science , signal (programming language) , nyquist rate , algorithm , telecommunications , computer vision , computer security , detector , programming language
This paper is motivated by some recent advances on what is now called “compressed sensing”. Let us begin with a theorem by Terence Tao. Let p be a prime number and Fp be the finite field with p elements. We denote by #E the cardinality of E ⊂ Fp. The Fourier transform of a complex valued function f defined on Fp is denoted by f . Let Mq be the collection of all f : Fp 7→ C such that the cardinality of the support of f does not exceed q. Then Terence Tao proved that for q < p/2 and for any set Ω of frequencies such that #Ω ≥ 2q, the mapping Φ : Mq 7→ l(Ω) defined by f 7→ 1Ωf is injective. Here and in what follows, 1E will denote the indicator function of the set E. This theorem is wrong if Fp is replaced by Z/NZ and if N is not a prime.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom