This is the Windows app named MSUs Sparse Fourier Repository whose latest release can be downloaded as DMSFT.zip. It can be run online in the free hosting provider OnWorks for workstations.
Download and run online this app named MSUs Sparse Fourier Repository with OnWorks for free.
Follow these instructions in order to run this app:
- 1. Downloaded this application in your PC.
- 2. Enter in our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 3. Upload this application in such filemanager.
- 4. Start any OS OnWorks online emulator from this website, but better Windows online emulator.
- 5. From the OnWorks Windows OS you have just started, goto our file manager https://www.onworks.net/myfiles.php?username=XXXXX with the username that you want.
- 6. Download the application and install it.
- 7. Download Wine from your Linux distributions software repositories. Once installed, you can then double-click the app to run them with Wine. You can also try PlayOnLinux, a fancy interface over Wine that will help you install popular Windows programs and games.
Wine is a way to run Windows software on Linux, but with no Windows required. Wine is an open-source Windows compatibility layer that can run Windows programs directly on any Linux desktop. Essentially, Wine is trying to re-implement enough of Windows from scratch so that it can run all those Windows applications without actually needing Windows.
MSUs Sparse Fourier Repository
Ad
DESCRIPTION
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
Audience
Science/Research, Developers
User interface
Command-line
Programming Language
C++
Categories
This is an application that can also be fetched from https://sourceforge.net/projects/aafftannarborfa/. It has been hosted in OnWorks in order to be run online in an easiest way from one of our free Operative Systems.
