6533b832fe1ef96bd129a1e3
RESEARCH PRODUCT
An optimized mass storage FFT for vector computers
N. D'amicoL. Nicastrosubject
Computer Networks and Communicationsbusiness.industryComputer scienceComputationFast Fourier transformPrime-factor FFT algorithmArray data typeComputer Graphics and Computer-Aided DesignTheoretical Computer ScienceVector processorsymbols.namesakeFourier transformSplit-radix FFT algorithmArtificial IntelligenceHardware and ArchitectureComputer data storagesymbolsbusinessAlgorithmSoftwaredescription
Abstract The performance of a segmented FFT algorithm which allows the out-of-core computation of the Fourier transform of a very large mass storage data array is presented. The code is particularly optimized for vector computers. Tests performed mainly on a CONVEX C210 vector computer showed that, for very long transforms, tuning of the main parameters involved leads to computation speed and global efficiency better than for FFTs performed in-core. The use of tunable parameters allows optimization of the algorithm on machines with different configurations.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1995-03-01 | Parallel Computing |