MSU's Sparse Fourier Repository

alpha

The Home of AAFFT, GFFT, and MSFFT.

5.0 Stars (2)
6 Downloads (This Week)
Last Update:
Download Multiscale_sfft.zip
Browse All Files

Description

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

Update Notifications





User Ratings

★★★★★
★★★★
★★★
★★
2
0
0
0
0
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

There are no 1 star reviews.

Additional Project Details

Intended Audience

Developers, Science/Research

User Interface

Command-line

Programming Language

C++

Registered

2008-07-23
Screenshots can attract more users to your project.
Features can attract more users to your project.

Icons must be PNG, GIF, or JPEG and less than 1 MiB in size. They will be displayed as 48x48 images.