The sparse Fourier transform: theory and practice

DOI10.1145/3166186MaRDI QIDQ4570972zbMATH OpenOpenAlexFDO

Authors Haitham Hassanieh

Publication date 5 July 2018

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

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)

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

Cited in

(11)

• Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
• scientific article; zbMATH DE number 7053345 (Why is no real title available?)
• On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm
• scientific article; zbMATH DE number 6796498 (Why is no real title available?)
• 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 generalized Fourier transforms
• Sparse Discrete Fractional Fourier Transform and Its Applications
• Sparse interpolation, the FFT algorithm and FIR filters

Describes a project that uses

Uses Software

• AAFFT
• SFFT
• FFTW

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)