A multiscale sub-linear time Fourier algorithm for noisy data
Authors:
- Andrew ChristliebACAndrew Christlieb
- David LawlorDLDavid Lawlor
- Yang WangYWYang Wang
- 1 May 2016
- journal article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 40 (3) , 553-574
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Air Force Office of Scientific Research (FA9550-11-1-0281)
- National Science Foundation (DMS-08135022)
- National Science Foundation (DMS-1127914)
- National Science Foundation (DMS-1043032)
- Oak Ridge Associated Universities
- U.S. Air Force (SPG-2355-SPG-12)
- U.S. Air Force (FA9550-12-1-0455)
This publication has 11 references indexed in Scilit:
- Deterministic Sparse Fourier Approximation Via Approximating Arithmetic ProgressionsIEEE Transactions on Information Theory, 2013
- ADAPTIVE SUB-LINEAR TIME FOURIER ALGORITHMSAdvances in Adaptive Data Analysis, 2013
- Combinatorial Sublinear-Time Fourier AlgorithmsFoundations of Computational Mathematics, 2010
- A New Flexible Filter Bank for Low Complexity Spectrum Sensing in Cognitive RadiosJournal of Signal Processing Systems, 2009
- Empirical evaluation of a sub-linear time sparse DFT algorithmCommunications in Mathematical Sciences, 2007
- A/D conversion with imperfect quantizersIEEE Transactions on Information Theory, 2006
- Rapid Computation of the Discrete Fourier TransformSIAM Journal on Scientific Computing, 1996
- Randomized Interpolation and Approximation of Sparse PolynomialsSIAM Journal on Computing, 1995
- Learning Decision Trees Using the Fourier SpectrumSIAM Journal on Computing, 1993
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965