A planar large sieve and sparsity of time-frequency representations

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(\mathbb{C}\right)$, 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.