Implementation of a prime factor FFT algorithm on CRAY-1
From MaRDI portal
Publication:1100875
DOI10.1016/0167-8191(88)90008-7zbMath0641.65098OpenAlexW2006537647MaRDI QIDQ1100875
Publication date: 1988
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(88)90008-7
fast Fourier transformvector computerCRAY-1Hockney's parameterprime factor FFT algorithmvectorizing a single transform
Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items
A new set of minimum-add small-n rotated DFT modules, Congruent Number Theta Coefficients to 1012, A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures, Nesting strategies for prime factor FFT algorithms, Parallel integration of ODEs based on convolution algorithms