Years and Authors of Summarized Original Work
2003; Akavia, Goldwasser, Safra
Problem Definition
Fourier transform is among the most widely used tools in computer science. Computing the Fourier transform of a signal of length N may be done in time \( { \Theta(N\log N) } \) using the Fast Fourier Transform (FFT) algorithm. This time bound clearly cannot be improved below \( { \Theta(N) } \), because the output itself is of length N. Nonetheless, it turns out that in many applications it suffices to find only the significant Fourier coefficients, i.e., Fourier coefficients occupying, say, at least \( { 1\,\% } \)of the energy of the signal. This motivates the problem discussed in this entry: the problem of efficiently finding and approximating the significant Fourier coefficients of a given signal (SFT, in short). A naive solution for SFT is to first compute the entire Fourier transform of the given signal and then to output only the significant Fourier coefficients; thus yielding no...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Akavia A, Goldwasser S (2005) Manuscript submitted as an NSF grant, awarded CCF-0514167
Akavia A, Goldwasser S, Safra S (2003) Proving hard-core predicates using list decoding. In: Proceedings of the 44th symposium on foundations of computer science (FOCS'03). IEEE Computer Society, pp 146–157
Atici A, Servedio RA (2006) Learning unions of ω(1)-dimensional rectangles. ALT, pp 32–47
Blum M, Micali S (1984) How to generate cryptographically strong sequences of pseudo-random bits. SIAM J Comput 4(13):850–864
Cormode G, Muthukrishnan S (2006) Combinatorial algorithms for compressed sensing. In: 13th International colloquium on structural information and communication complexity (SIROCCO), Chester, 2–5 July 2006, pp 280–294
Gilbert AC, Guha S, Indyk P, Muthukrishnan S, Strauss M (2002) Near-optimal sparse fourier representations via sampling. In: Proceedings of the thiry-fourth annual ACM symposium on theory of computing (STOC'02). ACM, pp 152–161
Gilbert AC, Muthukrishnan S, Strauss MJ (2005) Improved time bounds for near-optimal sparse Fourier representation via sampling. In: Proceedings of SPIE Wavelets XI, San Diego
Gilbert AC, Strauss MJ, Tropp JA, Vershynin R (2007) One sketch for all: fast algorithms for compressed sensing. In: Proceedings of the 39th ACM symposium on theory of computing (STOC'07)
Goldreich O, Levin L (1989) A hard-core predicate for all one-way functions. In: Proceedings of the 27th ACM symposium on theory of computing (STOC'89)
Mansour Y (1995) Randomized interpolation and approximation of sparse polynomials. SIAM J Comput 24:357–368
Sudan M (2000) List decoding: algorithms and applications. SIGART Newsl 31:16–27
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Akavia, A. (2016). Learning Significant Fourier Coefficients over Finite Abelian Groups. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_199
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_199
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering