Loading [MathJax]/extensions/TeX/mhchem.js
A Parallel Implementation of the Fast Fourier Transform Algorithm | IEEE Journals & Magazine | IEEE Xplore

A Parallel Implementation of the Fast Fourier Transform Algorithm


Abstract:

For many real-time signal processing problems, correlations, convolutions, and Fourier analysis must be performed in special-purpose digital hardware. At relatively high ...Show More

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].
Published in: IEEE Transactions on Computers ( Volume: C-21, Issue: 4, April 1972)
Page(s): 366 - 370
Date of Publication: 29 May 2009

ISSN Information:


References

References is not available for this document.