AAFFT (Ann Arbor Fast Fourier Transform). AAFFT, implemented by Mark Iwen, which was empirically evaluated in ”Empirical Evaluation of a Sub-Linear Time Sparse DFT Algorithm”. If you use AAFFT for your paper, please cite the empirical evaluation above.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Hassanieh, Haitham: The sparse Fourier transform: theory and practice (2018)
- Grigoryan, Artyom M.; Agaian, Sos S.: Tensor transform-based quaternion Fourier transform algorithm (2015)
- Dolgov, Sergey; Khoromskij, Boris; Savostyanov, Dmitry: Superfast Fourier transform using QTT approximation (2012)
- Hassanieh, Haitham; Indyk, Piotr; Katabi, Dina; Price, Eric: Simple and practical algorithm for sparse Fourier transform (2012)