Optimized Spectrum Permutation for the Multidimensional Sparse FFT

DOI10.1109/TSP.2016.2599483MaRDI QIDQ4620520zbMATH OpenOpenAlexFDO

Authors André Rauh, Gonzalo R. Arce

Publication date 8 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2016.2599483

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11)

Recommendations

• Performance of the multiscale sparse fast Fourier transform algorithm
• Nearly optimal sparse Fourier transform
• Deterministic sparse FFT for M-sparse vectors
• High-dimensional sparse FFT based on sampling along multiple rank-1 lattices
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
• Dimension-independent sparse Fourier transform
• A deterministic sparse FFT for functions with structured Fourier sparsity
• (Nearly) sample-optimal sparse Fourier transform
• On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm
• Multidimensional Sparse Fourier Transform Based on the Fourier Projection-Slice Theorem

Cited in

(1)

• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions

This page was built for publication: Optimized Spectrum Permutation for the Multidimensional Sparse FFT

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