# Estimating the Frequency of a Clustered Signal

@article{Chen2019EstimatingTF,
title={Estimating the Frequency of a Clustered Signal},
author={Xue Chen and Eric Price},
journal={ArXiv},
year={2019},
volume={abs/1904.13043}
}
• Published 30 April 2019
• Computer Science
• ArXiv

### Fourier-Sparse Interpolation without a Frequency Gap

• Computer Science
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
It is shown how to estimate the signal with a constant factor growth of the noise and sample complexity polynomial in k and logarithmic in the bandwidth and signal-to-noise ratio for arbitrary k-Fourier-sparse signals under l2 bounded noise.

### A universal sampling method for reconstructing signals with simple Fourier transforms

• Computer Science
STOC
• 2019
This work extends tools based on statistical leverage score sampling and column-based matrix reconstruction to the approximation of continuous linear operators that arise in the signal reconstruction problem, based on a novel connection between randomized linear algebra and the problem of reconstructing signals with constrained Fourier structure.

### A Robust Sparse Fourier Transform in the Continuous Setting

• Computer Science
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
An algorithm for robustly computing sparse Fourier transforms in the continuous setting and new results for how precisely the individual frequencies of x* can be recovered are given.

### Simple and practical algorithm for sparse Fourier transform

• Computer Science
SODA
• 2012
This work considers the sparse Fourier transform problem, and proposes a new algorithm, which leverages techniques from digital signal processing, notably Gaussian and Dolph-Chebyshev filters, and is faster than FFT, both in theory and practice.

### Improved time bounds for near-optimal sparse Fourier representations

• Computer Science
SPIE Optics + Photonics
• 2005
A significantly improved algorithm for the problem of finding a Fourier representation R of m terms for a given discrete signal A of length N and a quadratic-in-m algorithm that works for any values of Ni's is given.

### Sample-Optimal Fourier Sampling in Any Constant Dimension

• Computer Science
2014 IEEE 55th Annual Symposium on Foundations of Computer Science
• 2014
An algorithm for sparse recovery from Fourier measurements using O(k log N) samples, matching the lower bound of Do Ba-Indyk-Price-Woodruff'10 for non-adaptive algorithms up to constant factors for any k ≤ N<sup>1-δ</sup>.

### The Threshold for Super-resolution via Extremal Functions

This work exactly resolve the threshold at which noisy super-resolution is possible and establishes a sharp phase transition for the relationship between the cutoff frequency (m) and the separation (∆).

### Exact maximum likelihood parameter estimation of superimposed exponential signals in noise

• Computer Science
IEEE Trans. Acoust. Speech Signal Process.
• 1986
A unified framework for the exact maximum likelihood estimation of the parameters of superimposed exponential signals in noise, encompassing both the time series and the array problems, is presented and the present formulation is used to interpret previous methods.

### Randomized Interpolation and Approximation of Sparse Polynomials

• Y. Mansour
• Computer Science, Mathematics
SIAM J. Comput.
• 1992
A randomized algorithm is presented that interpolates a sparse polynomial in polynometric time in the bit complexity model and can be applied to approximate polynomials that can be approximated by sparse poynomials.