English

Compressed Sensing off the Grid

Information Theory 2013-07-12 v3 math.IT

Abstract

We consider the problem of estimating the frequency components of a mixture of s complex sinusoids from a random subset of n regularly spaced samples. Unlike previous work in compressed sensing, the frequencies are not assumed to lie on a grid, but can assume any values in the normalized frequency domain [0,1]. We propose an atomic norm minimization approach to exactly recover the unobserved samples. We reformulate this atomic norm minimization as an exact semidefinite program. Even with this continuous dictionary, we show that most sampling sets of size O(s log s log n) are sufficient to guarantee the exact frequency estimation with high probability, provided the frequencies are well separated. Numerical experiments are performed to illustrate the effectiveness of the proposed method.

Keywords

Cite

@article{arxiv.1207.6053,
  title  = {Compressed Sensing off the Grid},
  author = {Gongguo Tang and Badri Narayan Bhaskar and Parikshit Shah and Benjamin Recht},
  journal= {arXiv preprint arXiv:1207.6053},
  year   = {2013}
}

Comments

47 pages, 16 figures. Modified Section 2.2 on frequency localization via convex programming duality. Minor typos corrected

R2 v1 2026-06-21T21:41:23.541Z