(Nearly) sample-optimal sparse Fourier transform
From MaRDI portal
Approximation by other special function classes (41A30) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42B10) Randomized algorithms (68W20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)
Recommendations
- Nearly optimal sparse Fourier transform
- Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
- Combinatorial sublinear-time Fourier algorithms
- scientific article; zbMATH DE number 7053345
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
Cited in
(39)- Fast Haar transforms for graph neural networks
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
- Multiscale high-dimensional sparse Fourier algorithms for noisy data
- Quantum learning of concentrated Boolean functions
- A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
- Paraunitary matrices, entropy, algebraic condition number and Fourier computation
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
- Explicit universal sampling sets in finite vector spaces
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Empirical evaluation of a sub-linear time sparse DFT algorithm
- Theoretical and experimental analysis of a randomized algorithm for sparse Fourier transform analysis
- High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
- A deterministic sparse FFT algorithm for vectors with small support
- What's the frequency, Kenneth?: Sublinear Fourier sampling off the grid
- Tighter Fourier transform lower bounds
- Sparse Fourier Transform via Butterfly Algorithm
- The sparse Fourier transform: theory and practice
- Sparse Discrete Fractional Fourier Transform and Its Applications
- Approximation and Compression With Sparse Orthonormal Transforms
- Optimized Spectrum Permutation for the Multidimensional Sparse FFT
- An adaptive sublinear-time block sparse Fourier transform
- Sparse Recovery
- Estimating the frequency of a clustered signal
- Sparse fast trigonometric transforms
- Dimension-independent sparse Fourier transform
- Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time
- scientific article; zbMATH DE number 6796498 (Why is no real title available?)
- Nearly optimal sparse Fourier transform
- scientific article; zbMATH DE number 7053345 (Why is no real title available?)
- Performance of the multiscale sparse fast Fourier transform algorithm
- Deterministic sparse Fourier transform with an _ guarantee
- Sparse recovery for orthogonal polynomial transforms
- SCAN-MUSIC: an efficient super-resolution algorithm for large-scale single snapshot line spectral estimation
- Fast interpolation and multiplication of unbalanced polynomials
- What's the frequency, Kenneth?: sublinear Fourier sampling off the grid
- A sublinear algorithm for the recovery of signals with sparse Fourier transform when many samples are missing
- Sparse generalized Fourier transforms
- Combinatorial sublinear-time Fourier algorithms
This page was built for publication: (Nearly) sample-optimal sparse Fourier transform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5383996)
