Understanding DFT & FFT: Fourier Transform Basics

The discrete Fourier transform (DFT) transforms discrete time-domain signals into the frequency domain. The most efficient way to compute the DFT is using a fast Fourier transform (FFT) algorithm.

This Tech Talk answers a few common questions that are often asked about the DFT and the FFT. It covers an overview of the algorithm where you’ll be walked through an understanding of why you might look at the absolute value of the FFT, how bin width is calculated, and what the difference is between one-sided and two-sided FFTs.

Learn more:
- How to Do FFT in MATLAB: https://youtu.be/XEbV7WfoOSE
- What Is a Fast Fourier Transform? https://bit.ly/47uMTNu
- Veritasium: The Remarkable Story Behind the Most Important Algorithm of All Time: https://youtu.be/nmgFG7PUHfo
- FFT MATLAB App: https://bit.ly/FFT-MATLAB-App

--------------------------------------------------------------------------------------------------------
Get a free product trial: https://goo.gl/ZHFb5u
Learn more about MATLAB: https://goo.gl/8QV7ZZ
Learn more about Simulink: https://goo.gl/nqnbLe
See what's new in MATLAB and Simulink: https://goo.gl/pgGtod

© 2023 The MathWorks, Inc. MATLAB and Simulink are registered trademarks of The MathWorks, Inc.
See www.mathworks.com/trademarks for a list of additional trademarks. Other product or brand names may be trademarks or registered trademarks of their respective holders.