A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Learning decision trees using the Fourier spectrum
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Elements of information theory
Elements of information theory
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
Data driven signal processing: an approach for energy efficient computing
ISLPED '96 Proceedings of the 1996 international symposium on Low power electronics and design
Near-optimal sparse fourier representations via sampling
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
OFDM Wireless LANs: A Theoretical and Practical Guide
OFDM Wireless LANs: A Theoretical and Practical Guide
Efficient Similarity Search In Sequence Databases
FODO '93 Proceedings of the 4th International Conference on Foundations of Data Organization and Algorithms
Randomized Interpolation and Approximation of Sparse Polynomials
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Proving Hard-Core Predicates Using List Decoding
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Some topics in analysis of boolean functions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The influence of variables on Boolean functions
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Combinatorial Sublinear-Time Fourier Algorithms
Foundations of Computational Mathematics
Approximate sparse recovery: optimizing time and measurements
Proceedings of the forty-second ACM symposium on Theory of computing
Fast approximate correlation for massive time-series data
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
A New Flexible Filter Bank for Low Complexity Spectrum Sensing in Cognitive Radios
Journal of Signal Processing Systems
On the Power of Adaptivity in Sparse Recovery
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
(1 + eps)-Approximate Sparse Recovery
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Simple and practical algorithm for sparse Fourier transform
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Faster GPS via the sparse fourier transform
Proceedings of the 18th annual international conference on Mobile computing and networking
A framework for low-communication 1-D FFT
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Proceedings of the 14th Workshop on Mobile Computing Systems and Applications
Sketching via hashing: from heavy hitters to compressed sensing to sparse fourier transform
Proceedings of the 32nd symposium on Principles of database systems
Invariant object recognition using radon and fourier transforms
ISNN'13 Proceedings of the 10th international conference on Advances in Neural Networks - Volume Part I
Illumination invariant face recognition
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories
IA^3 '13 Proceedings of the 3rd Workshop on Irregular Applications: Architectures and Algorithms
Expert Systems with Applications: An International Journal
A framework for low-communication 1-D FFT
Scientific Programming - Selected Papers from Super Computing 2012
Hi-index | 0.00 |
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an n-dimensional signal. We show: An O(k log n)-time randomized algorithm for the case where the input signal has at most k non-zero Fourier coefficients, and An O(k log n log(n/k))-time randomized algorithm for general input signals. Both algorithms achieve o(n log n) time, and thus improve over the Fast Fourier Transform, for any k=o(n). They are the first known algorithms that satisfy this property. Also, if one assumes that the Fast Fourier Transform is optimal, the algorithm for the exactly k-sparse case is optimal for any k = nΩ(1). We complement our algorithmic results by showing that any algorithm for computing the sparse Fourier transform of a general signal must use at least Ω(k log (n/k) / log log n) signal samples, even if it is allowed to perform adaptive sampling.