Computing the Spectrum of Sampled Signals with the Discrete Fourier Transform
The discrete Fourier transform (DFT) is the computational tool for finding the spectrum of a sampled signal. You will learn how to relate the DFT coefficients to the spectrum of both the sampled and original continuous-time signal.
▶︎
Understanding the Discrete Fourier Transform and the FFT
▶︎
Understanding the Z-Transform
▶︎
Introduction to the Fourier Transform (Part 1)
▶︎
Finding Fourier coefficients for square wave
▶︎
The Discrete Fourier Transform (DFT)
▶︎
But what is the Fourier Transform? A visual introduction.
▶︎
TI Precision Labs – ADCs: Fast Fourier Transforms (FFTs) and Windowing
▶︎
Short-Time Fourier Transform Explained Easily
▶︎
Complex Sinusoid Representations for Real Sinusoids
▶︎
How are the Fourier Series, Fourier Transform, DTFT, DFT, FFT, LT and ZT Related?
▶︎
If Prime Numbers Become Increasingly Rare, Then Why Do They Keep Showing Up In Pairs?
▶︎
What is the Fourier Transform? ("Brilliant explanation!")
▶︎
The Fast Fourier Transform (FFT): Most Ingenious Algorithm Ever?
▶︎
What is a Discrete Fourier Transform (DFT) and an FFT?
▶︎
Short-time Fourier Transform and the Spectogram
▶︎
Fourier Transform, Fourier Series, and frequency spectrum
▶︎
Understanding Spectrum Analyzers – Noise Figure
▶︎
If You Have A Bad Memory, I’ll Help You Fix It In 28 Minutes
▶︎
Fourier Transform Explained (for Beginners)
▶︎