Sparse Fourier Transform From Theory to Practice

Supported by NSF CCF Award #1535851

Piotr Indyk      Dina Katabi

Computer Science & Artificial Intelligence Laboratory
Massachusetts Institute of Technology

Sparse Fourier Transform From Theory to Practice

The goal of the project is to develop efficient algorithms and implementations of sparse Fourier Transform, and apply them to specific application domains, such as networked system for delivering smart services.

Major Activities:


Decimeter-level localization with a single WiFi access point
Deepak Vasisht, Swarun Kumar, and Dina Katabi (2016). 
13th USENIX Symposium on Networked Systems Design and Implementation (NSDI). Santa Clara, CA.

Nearly optimal deterministic algorithm for sparse Walsh-Hadamard transform
Mahdi Cheraghchi, and Piotr Indyk (2016).
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Washington, DC.

Agile Millimeter Wave Networks with Provable Guarantees
Haitham Hassanieh, Omid Abari, Michael Rodriguez, Mohammed Abdelghany, Dina Katabi and Piotr Indyk (2017).