Vectorized mixed radix discrete Fourier transform algorithms
Journal Article
·
· Proc. IEEE; (United States)
A number of previous attempts at the vectorization of the fast Fourier transform (FFT) algorithm have fallen somewhat short of achieving the full potential speed of vector processors. The algorithm formulation and implementation described here not only achieves full vector utilization but successfully copes with the problems of hierarchical storage. In the present paper, these techniques are described and extended to the general mixed radix algorithms, prime factor algorithm (PFA), the multidimensional discrete Fourier transform (DFT), the rectangular transform convolution algorithms, and the Winograd fast Fourier transform algorithm.
- Research Organization:
- IBM Thomas J. Watson Research Center, Yorktown Heights, NY 10598
- OSTI ID:
- 5756707
- Journal Information:
- Proc. IEEE; (United States), Journal Name: Proc. IEEE; (United States) Vol. 75:9; ISSN IEEPA
- Country of Publication:
- United States
- Language:
- English
Similar Records
Efficient computer architectures for computing Discrete Fourier Transforms. Master's thesis
Effects of computer architecture on FFT (Fast Fourier Transform) algorithm performance. Master's thesis
High-speed VLSI networks for computing the discrete fourier transform
Technical Report
·
Mon Nov 30 23:00:00 EST 1981
·
OSTI ID:6757088
Effects of computer architecture on FFT (Fast Fourier Transform) algorithm performance. Master's thesis
Technical Report
·
Wed Nov 30 23:00:00 EST 1983
·
OSTI ID:7091557
High-speed VLSI networks for computing the discrete fourier transform
Book
·
Sat Dec 31 23:00:00 EST 1983
·
OSTI ID:5082445