A Parallel Implementation of the Fast Fourier Transform Algorithm
- 1 April 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (4) , 366-370
- https://doi.org/10.1109/TC.1972.5008977
Abstract
For many real-time signal processing problems, correlations, convolutions, and Fourier analysis must be performed in special-purpose digital hardware. At relatively high levels of performance, it becomes necessary for this hardware to perform some of its computations in parallel. A parallel FFT algorithm is described that segments the fast Fourier transform algorithm into groups of identical parallel operations that can be performed concurrently and independently. A hardware implementation of the algorithm is described in the context of the parallel element processing ensemble (PEPE) previously described by Githens [7], [8].Keywords
This publication has 6 references indexed in Scilit:
- The Relationship Between Two Fast Fourier TransformsIEEE Transactions on Computers, 1971
- Fast Fourier transform hardware implementations--A surveyIEEE Transactions on Audio and Electroacoustics, 1969
- A fast Fourier transform global, highly parallel processorIEEE Transactions on Audio and Electroacoustics, 1969
- A Fast Fourier Transform Algorithm Using Base 8 IterationsMathematics of Computation, 1968
- Fast Fourier TransformsPublished by Association for Computing Machinery (ACM) ,1966
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965