A Fast Fourier Transform (FFT) method for frequency sparse functions. Recovers the k most energetic frequencies hidden in a bandwidth-N function in k*polylog(N) time.
Project Reviews
-
Thumbs up
Interesting!
Rate and Review
Related Projects
-
GFFT
Generic simple and efficient Fast Fourier Transforms (FFT) implementation using policy-based design and template metaprogramming in C++
-
ZoekO
ZoekO is a vintage game, originally coded by Joris Schoolmeesters for the Texas Instruments TI-83 calculator. The goal is to find the 'O' hidden in a grid of zeroes (these two characters only differ by 3 pixels on the TI-83).
-
AAFFT (Ann Arbor Fast Fourier Transform) Actions
About SourceForge
Develop Software
Community
Copyright © 2010 Geeknet, Inc. All rights reserved. Terms of Use
