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 well-known algorithm, called the Radix 2 FFT, and requires that its’ input data be an integral power of two in length.Part 3 of this series of papers, demonstrates the computation of the PSD (Power Spectral Density) and applications of the DFT and IDFT. The applications include filtering, windowing, pitch shifting and the spectral analysis of re-sampling.
Note: Due to the typographical sophistication of this article, no HTML version is available. Please use the PDF version.
About the author
Douglas A. Lyon: "The Discrete Fourier Transform, Part 2: Radix 2 FFT", in Journal of Object Technology, vol. 8. no. 5, July-August 2009 pp. 21-33 http://www.jot.fm/issues/issue_2009_07/column2/