Implementation of a prime factor FFT algorithm on CRAY-1

DOI10.1016/0167-8191(88)90008-7MaRDI QIDQ1100875zbMATH OpenOpenAlexFDO

Authors Clive Temperton

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

zbMATH Keywords

fast Fourier transformvector computerCRAY-1Hockney's parameterprime factor FFT algorithmvectorizing a single transform

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15)

Recommendations

• Implementation of a self-sorting in-place prime factor FFT algorithm
• A high-performance fast Fourier transform algorithm for the Cray-2
• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
• FFT algorithms for prime transform sizes and their implementations on VAX, IBM3090VF, and IBM RS/6000
• FFT algorithms for vector computers

Cited in

(10)

• A new set of minimum-add small-n rotated DFT modules
• Ultrahigh-performance FFTs for the CRAY-2 and CRAY Y-MP supercomputers
• A high-performance fast Fourier transform algorithm for the Cray-2
• A segmented FFT algorithm for vector computers
• A methodology for designing, modifying, and implementing Fourier transform algorithms on various architectures
• Nesting strategies for prime factor FFT algorithms
• Implementation of a self-sorting in-place prime factor FFT algorithm
• Parallel integration of ODEs based on convolution algorithms
• Congruent Number Theta Coefficients to 1012
• Further measurements of \((r_{\infty},n_{1/2})\) on the CRAY-1 and CRAY X-MP

This page was built for publication: Implementation of a prime factor FFT algorithm on CRAY-1

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