5/18/2017 Julia Sullivan, ECE ILLINOIS 2 min read
Written by Julia Sullivan, ECE ILLINOIS
By Julia Sullivan, ECE ILLINOIS
This new rate surpasses the Fast Fourier Transform (FFT), long considered to be the most efficient algorithm in this area. However, the FFT has struggled to keep up with Big Data. Hassanieh not only presented the theoretical foundation of his new Sparse Fourier Transform (SFT), but also demonstrates how it could be used to solve key problems in wireless networks, mobile systems, computer graphics, medical imaging, biochemistry, and digital circuits.
Prof. Hassanieh came to Illinois from MIT in spring 2016. His Sparse Fourier Transform algorithm was previously chosen by MIT Technology Review as one of the top 10 breakthrough technologies of 2012. He has also been recognized with the Sprowls Award for Best Dissertation in Computer Science and the SIGCOMM Best Paper Award.
Learn more about Hassanieh's award and the two honorable mentions presented by ACM this year.