SFFT: An implementation of the MIT Sparse FFT is now available

I ain't gonna get scooped by TechCrunch this time!

The MIT folks released an implementation of their Faster than Fast Fourier Transform, they called it SFFT and it is here. It is faster than FFT because it uses the fact that the underlying signal is sparse in the frequency domain. Thank you Haitham Hassanieh, Piotr Indyk, Dina Katabi and Eric Price!

Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.