On vectorizing the fast fourier transform

DOI10.1007/BF01933196MaRDI QIDQ3860787zbMATH OpenFDO

Authors

Publication date 1980

Published in BIT (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01933196

zbMATH Keywords

Cooley-Tukey algorithmfast Fourier transformPease algorithmStockham algorithmvector computer

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40) Theory of operating systems (68N25)

Cites work

• An Adaptation of the Fast Fourier Transform for Parallel Processing
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An Extension of Eklundh's Matrix Transposition Algorithm and Its Application in Digital Image Processing
• Computing the Fast Fourier Transform on a Vector Computer
• On computing the fast Fourier transform
• Parallel Processing with the Perfect Shuffle

This page was built for publication: On vectorizing the fast fourier transform

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