On vectorizing the fast fourier transform
From MaRDI portal
Publication:3860787
DOI10.1007/BF01933196zbMath0425.65080MaRDI QIDQ3860787
No author found.
Publication date: 1980
Published in: BIT (Search for Journal in Brave)
Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40) Theory of operating systems (68N25)
Cites Work
- An Extension of Eklundh's Matrix Transposition Algorithm and Its Application in Digital Image Processing
- Computing the Fast Fourier Transform on a Vector Computer
- An Algorithm for the Machine Calculation of Complex Fourier Series
- On computing the fast Fourier transform
- An Adaptation of the Fast Fourier Transform for Parallel Processing
- Parallel Processing with the Perfect Shuffle
This page was built for publication: On vectorizing the fast fourier transform