... efficiently. It is much slower than it should be.
3.) 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".
4.) MSFFT, implemented by David Lawlor and Bosu Choi. This code is fast, but is not terribly easy to use. The algorithm is robust to some noise, but requires a lot of parameter tuning.
Enjoy at your own risk :),
Mark Iwen