volume 9, issue 1-2, P163-178 1995
DOI: 10.1007/bf01245402
View full text
|
|
Share

Abstract: Abstract. Some implementations of a power-of-two one-dimensional fast Fourier transform (FFT) on vector computers use radix-4 Stockham autosort kernels with a separate transpose step. This paper describes an algorithm that performs well on a Convex C4/XA vector supercomputer on large FFTs by using higher-radix kemels and moving the transpose step into the computational steps. For short transforms a different algorithm is used that calculates the FFT without storing any intermediate results to memory. Performa…

Expand abstract

Search citation statements

Order By: Relevance

Citation Types

0
2
0

Paper Sections

0
0
0
0
0

Publication Types

0
0
0
0

Relationship

0
0

Authors

Journals