Efficient Computer Architectures for Computing Discrete Fourier Transforms.
Abstract
The effects of the IBM 370-155, CDC Cyber 750, Cray-1, and PDP 11/60 architectures on executing selected Discrete Fourier Transform (DFT) algorithms are investigated. The selected DFT algorithms are the radic-2 FFT, mixed-radix FFT, Winograd Fourier Transform Algorithm (WFTA), and Prime Factor Algorithm (PFA). The overall execution times on each computer system is determined. For the IBM 370/155 and CDC Cyber 750, the number and type of instructions and the execution time required for each portion of the FFT programs is determined. This study shows that the number of floating-point additions and multiplications required by the FFT programs determine these programs' execution times on the IBM 370/155. This study also investigated the relationship between the number of a processor's general-purpose registers and the number of data transfers required by an FFT program. Results from the IBM 370/155 and Cyber 750 systems showed that the computer system with fewer registers required more data transfers.
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1981
- Accession Number
- ADA138109
Entities
People
- G. P. Route
Organizations
- Air Force Institute of Technology