Sparse FFT small support
From MaRDI portal
Cited in
(11)- Sparse fast DCT for vectors with one-block support
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Deterministic sparse FFT for M-sparse vectors
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees
- High-dimensional sparse Fourier algorithms
- Deterministic sparse sublinear FFT with improved numerical stability
- SFFT
- DCT_shortsupp_oneblock
- DFT_twoblock
- idct
- Real sparse fast DCT for vectors with short support
This page was built for software: Sparse FFT small support