A segmented FFT algorithm for vector computers (Q1097674)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A segmented FFT algorithm for vector computers |
scientific article; zbMATH DE number 4035095
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A segmented FFT algorithm for vector computers |
scientific article; zbMATH DE number 4035095 |
Statements
A segmented FFT algorithm for vector computers (English)
0 references
1988
0 references
A segmented algorithm is given for efficient implementation of the fast Fourier transform on vector processors. For a transform of length \(N=rs\), the computation comprises s FFTs of length r, and r FFTs of length s, phase rotations and the matrix transpositions.
0 references
CYBER-205
0 references
FFT
0 references
vector computers
0 references
vectorization
0 references
multiple transformation
0 references
segmented algorithm
0 references
fast Fourier transform
0 references
vector processors
0 references
phase rotations
0 references
