A planar large sieve and sparsity of time-frequency representations

arXiv1702.08274MaRDI QIDQ6283673FDOQ6283673

Authors: Luís Daniel Abreu, M. Speckbacher 

Publication date: 27 February 2017

Abstract: With the aim of measuring the sparsity of a real signal, Donoho and Logan introduced the concept of maximum Nyquist density, and used it to extend Bombieri's principle of the large sieve to bandlimited functions. This led to several recovery algorithms based on the minimization of the $L_1$-norm. In this paper we introduce the concept of { planar maximum} Nyquist density, which measures the sparsity of the time-frequency distribution of a function. We obtain a planar large sieve principle which applies to time-frequency representations with a gaussian window, or equivalently, to Fock spaces, $mathcal{F}_{1}left(mathbbCight)$, allowing for perfect recovery of the short-Fourier transform (STFT) of functions in the modulation space $M_1$ (also known as Feichtinger's algebra $S_0$) corrupted by sparse noise and for approximation of missing STFT data in $M_1$, by $L_1$-minimization.

This page was built for publication: A planar large sieve and sparsity of time-frequency representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283673)