Description

The Fast Fourier Transform (FFT) is an efficient computation of the Discrete Fourier Transform (DFT) and one of the most important tools used in digital signal processing applications. Because of its well-structured form the FFT is a benchmark in assessing digital signal processor (DSP) performance. The development of FFT algorithms has assumed an input sequence consisting of complex numbers.