Hello viewers, In this video, the basic theory of Discrete Fourier Transform (DFT) is presented. It includes background of DTFT and evolution of DFT from DTFT. It also explains that how DFT can be expressed as linear transformation for easy calculation of forward DFT and inverse DFT. Also computational complexity of DFT/ IDFT calculation is discussed and compared with FFT. The MATLAB implementation is also given by which one can find N-point DFT of any real sequence of any length. This video includes following topics,
* Introduction to Discrete Time Fourier Transform (DTFT).
* Need of Discrete Fourier Transform (DFT).
* DFT Computation method.
* DFT as linear transformation.
* Algorithm complexity.
* MATLAB Code to find N-point DFT of any sequence.
---------------------------------------------------------------------------
Link of previous video
Discrete Fourier Transform (DFT) of images and image filtering: Click Here
0 Comments:
Post a Comment