Comparison of signal processing methods for calculating point-by-point Discrete Fourier Transforms

This paper presents and compares signal processing architectures for calculating point-by-point discrete signal spectra. Besides the well known Discrete Fourier Transform (DFT) and its well known fast implementation, the FFT, the Sliding Discrete Fourier Transform (S-DFT) and the less known Recursive Discrete Fourier Transform (R-DFT) are discussed. These algorithms are compared by calculation complexity for FPGA implementation. Furthermore, their sensitivity to quantization effects are also examined, based on simulations.