The Discrete Fourier Transform, Part 2: Radix 2 FFT.
Douglas A. Lyon · The Journal of Object Technology · 2009
This paper is part 2 in a series of papers about the Discrete Fourier Transform (DFT) and the Inverse Discrete Fourier Transform (IDFT).The focus of this paper is on a fast implementation of the DFT, called the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform).The implementation is based on a wellknown algorithm, called the Radix 2 FFT, and requires that its' input data be an integral power of two in length.VOL. 8, NO. 5.