Estimating the frequency of a clustered signal

DOI10.4230/LIPICS.ICALP.2019.36MaRDI QIDQ5091186zbMATH OpenFDO

Authors Xue Chen, Eric Price

Publication date 21 July 2022

Full work available at URL https://arxiv.org/abs/1904.13043

zbMATH Keywords

Fourier transformsublinear algorithms

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Recommendations

• What's the frequency, Kenneth?: Sublinear Fourier sampling off the grid
• What's the frequency, Kenneth?: sublinear Fourier sampling off the grid
• Combinatorial sublinear-time Fourier algorithms
• (Nearly) sample-optimal sparse Fourier transform
• An adaptive sublinear-time block sparse Fourier transform

Cites work

• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• A universal sampling method for reconstructing signals with simple Fourier transforms
• scientific article; zbMATH DE number 7053345 (Why is no real title available?)
• Near-optimal sparse fourier representations via sampling
• Randomized interpolation and approximation of sparse polynomials stPreliminary version
• Super-resolution, extremal functions and the condition number of Vandermonde matrices

Cited in

(2)

• Testing and estimation for clustered signals
• Optimal Extrapolation Bounds for Sparse Fourier Sums

This page was built for publication: Estimating the frequency of a clustered signal

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