ABSTRACT
The Discrete Fourier Transform (DFT) is an extension of the DTFT for time-limited sequences, thus it plays a significant role in theoretical research. Furthermore, due to the existence of a quick and ecient method to calculate DFT-the Fast Fourier Transform (FFT), it is undeniable that the DFT plays the core part in all kinds of digital signal processing algorithms. This article elaborates the course from Fourier Transform (FT) to Discrete Fourier Transform (DFT) by virtue of a compute instance, and analyzes main types of DFT errors: aliasing eect, spectrum leakage, and picket fence eect, in order to strengthen the reader’s comprehension and grasp of the concerning concepts.
