A sparse data fast fourier transform (SDFFT)

DOI10.1109/TAP.2003.818792MaRDI QIDQ5349848zbMATH OpenFDO

Authors Alaeddin A. Aydıner, Weng Cho Chew, Jiming Song, T. J. Cui

Publication date 25 August 2017

Published in IEEE Transactions on Antennas and Propagation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAP.2003.818792

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Antennas, waveguides in optics and electromagnetic theory (78A50)

Cited in

(6)

• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
• Sparse data structure design for wavelet-based methods
• Sparse Fourier Transform via Butterfly Algorithm
• Fast Approximate Fourier Transforms for Irregularly Spaced Data
• On Performance of Sparse Fast Fourier Transform and Enhancement Algorithm
• scientific article; zbMATH DE number 7053345 (Why is no real title available?)

This page was built for publication: A sparse data fast fourier transform (SDFFT)

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