Title :
Parallelism in fast Fourier transform hardware
Author :
Gold, Bernard ; Bially, Theodore
Author_Institution :
M.I.T., Lincoln Laboratory, Lexington, MA
fDate :
2/1/1973 12:00:00 AM
Abstract :
The fast Fourier transform algorithm is derived by means of successive fracturing of one-dimensional data strings into two-dimensional arrays. Using this formulation, a diagrammatic representation of mixed radix and highest radix FFT algorithms is derived. Using this representation, two broad classes of FFT hard-ware are explored, from the point of view of speed, parallelism, radix number, and type of memory.
Keywords :
Algorithm design and analysis; Arithmetic; Discrete Fourier transforms; Fast Fourier transforms; Fourier transforms; Gold; Hardware; Military computing; Parallel processing; Registers;
Journal_Title :
Audio and Electroacoustics, IEEE Transactions on
DOI :
10.1109/TAU.1973.1162428
