A collection of several sparse Fourier transform codes developed by faculty at MSU. Currently codes for three different prototype sparse FFTs are on this site:
1.) AAFFT, implemented by Mark Iwen in 2008. This code is easy to use, and documented well, but not implemented very efficiently. It is much slower than it should be.
2.) GFFT, implemented by Ben Segal and Mark Iwen. This code is less easy to use, and also not terribly efficient. But, the *algorithm* itself is significantly simpler and has "essentially no parameters". The code on the site demonstrates that it's faster than a slightly improved version of AAFFT, despite the fact it was implemented somewhat inefficiently.
3.) MSFFT, implemented by David Lawlor and Bosu Choi. This code is fastest of all, but is not terribly easy to use. The algorithm is robust to random noise, but requires a lot of parameter tuning.
Enjoy them at your own risk :),
P.S. Challenge: Improve any of these codes!
There are no 3 star reviews.