Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Lecture
Fast Fourier Transform
Description
This lecture covers the Fast Fourier Transform (FFT), a fast algorithm to calculate the Discrete Fourier Transform (DFT). It explains the mathematical operations involved in FFT, such as splitting the DFT into smaller series and the complexity reduction compared to direct methods.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.