Welcome to Exploring Technologies

A True Learning Platform

Have smile on face and Confidence in heart

Learn with me, Grow with Me

Become the leader and step ahead of others

Do excel in areas of your expertise and lead the world

Come and join hands with me

Let us learn and grow together to make our tomorrow better.

Video 55: Discrete Fourier Transform (DFT) of 1-D Signals


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