MSU’s Sparse Fourier Repository

A collection of sparse Fourier transform codes developed by faculty at MSU. Currently codes for four different prototype sparse FFTs are here:

1.) DMSFT, implemented by Ruochuan Zhang. This is a fast, stable, noise robust, and *fully discrete* improvement on the ideas in GFFT below. It is THE BEST sparse FFT around!!! If you’re looking for AAFFT, try this out first.

2.) 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.

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

If you are like the rest of our user community, your IT team is busy. With pressure to deliver on-time projects, you don’t have a lot of time to spend making your management tools work. You need network monitoring tools that work for you. You want tools that makes it easy to find performance issues before your users do and resolve them before they impact the business. That’s why tens of thousands of customers around the world love WhatsUp Gold.