A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
The Discrete Fourier Transform, Part 3: The PSD
Journal of Object Technology
This paper is part 3 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 computing the Power Spectral Density (PSD) of the FFT (Fast Fourier Transform) and the IFFT (Inverse Fast Fourier Transform). The implementation is based on a well-known algorithm, called the decimation in time Radix 2 FFT, and requires that its' input data be an integral power of two in length. This paper demonstrates thedoi:10.5381/jot.2009.8.6.c2 fatcat:reaojwewfvf47bcqzritzcwffi