Fast Fourier transforms: a tutorial review and a state of the art
P Duhamel, M Vetterli - Signal processing, 1990 - Elsevier
Signal processing, 1990•Elsevier
The publication of the Cooley-Tukey fast Fourier transform (FFT) algorithm in 1965 has
opened a new area in digital signal processing by reducing the order of complexity of some
crucial computational tasks like Fourier transform and convultion from N 2 to N log 2, where
N is the problem size. The development of the major algorithms (Cooley-Tukey and split-
radix FFT, prime factor algorithm and Winograd fast Fourier transform) is reviewed. Then, an
attempt is made to indicate the state of the art on the subject, showin the standing of researh …
opened a new area in digital signal processing by reducing the order of complexity of some
crucial computational tasks like Fourier transform and convultion from N 2 to N log 2, where
N is the problem size. The development of the major algorithms (Cooley-Tukey and split-
radix FFT, prime factor algorithm and Winograd fast Fourier transform) is reviewed. Then, an
attempt is made to indicate the state of the art on the subject, showin the standing of researh …
Abstract
The publication of the Cooley-Tukey fast Fourier transform (FFT) algorithm in 1965 has opened a new area in digital signal processing by reducing the order of complexity of some crucial computational tasks like Fourier transform and convultion from N2 to N log2, where N is the problem size. The development of the major algorithms (Cooley-Tukey and split-radix FFT, prime factor algorithm and Winograd fast Fourier transform) is reviewed. Then, an attempt is made to indicate the state of the art on the subject, showin the standing of researh, open problems and implementations.
Elsevier