MSU's Sparse Fourier Repository Icon

MSU's Sparse Fourier Repository


The Home of AAFFT, GFFT, and MSFFT.

0.0 Stars (2)
0 Downloads (This Week)
Last Update:
Browse All Files


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 :),

Mark Iwen

P.S. Challenge: Improve any of these codes!

MSU's Sparse Fourier Repository Web Site


User Ratings

ease 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
features 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
design 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
support 1 of 5 2 of 5 3 of 5 4 of 5 5 of 5 0 / 5
Write a Review

User Reviews

Be the first to post a review of MSU's Sparse Fourier Repository!

Additional Project Details

Intended Audience

Developers, Science/Research

User Interface


Programming Language




Thanks for helping keep SourceForge clean.

Screenshot instructions:
Red Hat Linux   Ubuntu

Click URL instructions:
Right-click on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)

More information about our ad policies

Briefly describe the problem (required):

Upload screenshot of ad (required):
Select a file, or drag & drop file here.

Please provide the ad click URL, if possible:

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:

No, thanks