Lecture 16: Fast Fourier Transform (FFT), Aliasing, and Sampling Theorem with MATLAB Example @bahgalabiitdelhi7797

Uploaded August 2020 | Updated September 2026, 1 hour ago

In this lecture, we discusses the Fast Fourier Transform method for computing the Discrete Fourier Transform (DFT). We look at the computational efficiency provided by FFT. Thereafter, we look using the fft function in MATLAB. We also discuss the aliasing phenomenon and the sampling theorem that suggests the criterion for choosing the sampling frequency to avoid aliasing. In the lecture, I have referred to a video on aliasing. The link for the video is: youtube.com/watch?v=xTo3gxsZOWo

Lecture 16: Fast Fourier Transform (FFT), Aliasing, and Sampling Theorem with MATLAB Example

Lecture 31: T-s, h-s, p-h diagrams, Gibbs Phase Rule, and Clausius-Clayperon Equation

Lecture 1: Introduction to Fourier Series

Lecture 29: Capillary Electrophoresis (Introduction)

Lecture 23: Entropy (Engineering Thermodynamics Lecture Series)

Machine learning and IoT enabled hydroponics system using Sony Spresense

Lecture 24: Electrical double layer as a capacitor

Lecture 10: The First Law of Thermodynamics (Engineering Thermodynamics Lecture Series)

Lecture 7: Hele-Shaw Flows (Part 1, Governing Equations)

Lecture 4: Basic Concepts & Definitions in Thermodynamics (system, surroundings, properties)

Lecture 3: Intuition behind Fourier Series: Analogy with Euclidean Geometry

Lecture 21: Governing Equations for Electrokinetic Transport