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 (FFT): Lecture 4
Description
This lecture covers the Fast Fourier Transform (FFT) algorithm, including the review of practical aspects of Discrete Fourier Transform (DFT), interpolation formula, FFT in N dimensions, and examples from exercise sessions. The FFT algorithm is explained as a divide and conquer approach, with details on radix-2 FFT and its implementation. The lecture also delves into the application of FFT in image processing, filters, noise removal, and experimental techniques like Transmission Electron Microscopy (TEM) and Scanning Tunneling Microscopy (STM).
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.