The sparse Fourier transform: theory and practice

DOI10.1145/3166186zbMATH Open1447.65004OpenAlexW2793332341MaRDI QIDQ4570972FDOQ4570972

Authors: Haitham Hassanieh 

Publication date: 5 July 2018

Full work available at URL: https://doi.org/10.1145/3166186

Recommendations

• scientific article; zbMATH DE number 6796498
• Nearly optimal sparse Fourier transform
• scientific article; zbMATH DE number 7053345
• Sparse Fourier Transform via Butterfly Algorithm
• (Nearly) sample-optimal sparse Fourier transform

zbMATH Keywords

applicationsfast Fourier transformsampling complexityVLSI implementationsublinear runtimeresearch expositorysparse Fourier transform

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Numerical methods for discrete and fast Fourier transforms (65T50)

Cited In (10)

• Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
• Title not available (Why is that?)
• On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm
• Title not available (Why is that?)
• Aggregated hold out for sparse linear regression with a robust loss function
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
• Sparse Fourier Transform via Butterfly Algorithm
• Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
• Sparse Discrete Fractional Fourier Transform and Its Applications
• Sparse generalized Fourier transforms

Uses Software

• FFTW
• SFFT
• AAFFT

This page was built for publication: The sparse Fourier transform: theory and practice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570972)