Performance of the multiscale sparse fast Fourier transform algorithm
From MaRDI portal
Publication:6045575
DOI10.1007/s00034-022-01989-6zbMath1510.94053arXiv2011.05698OpenAlexW3105747956MaRDI QIDQ6045575
No author found.
Publication date: 12 May 2023
Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.05698
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Application of orthogonal and other special functions (94A11)
Cites Work
- Unnamed Item
- A multiscale sub-linear time Fourier algorithm for noisy data
- A deterministic sparse FFT algorithm for vectors with small support
- Wave packet transforms over finite cyclic groups
- Combinatorial sublinear-time Fourier algorithms
- Deterministic sparse FFT for \(M\)-sparse vectors
- Improved approximation guarantees for sublinear-time Fourier algorithms
- A sparse fast Fourier algorithm for real non-negative vectors
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- Empirical evaluation of a sub-linear time sparse DFT algorithm
- Wave Packet Transform over Finite Fields
- Spectral Analysis of Signals: The Missing Data Case
- Near-optimal sparse fourier representations via sampling
- FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time
- R-FFAST: A Robust Sub-Linear Time Algorithm for Computing a Sparse DFT
- On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm
- Multidimensional Sparse Fourier Transform Based on the Fourier Projection-Slice Theorem
- Dimension-independent Sparse Fourier Transform
- Cyclic wave packet transform on finite Abelian groups of prime order
- (Nearly) Sample-Optimal Sparse Fourier Transform
- Nearly optimal sparse fourier transform
This page was built for publication: Performance of the multiscale sparse fast Fourier transform algorithm
