Lecture

Fast Fourier Transform (FFT): Basics and Applications

Description

This lecture covers the Fast Fourier Transform (FFT) algorithm, including the review of the Discrete Fourier transform (DFT), interpolation formula, and FFT implementation. It explains the practical aspects of DFT, the FFT algorithm's efficiency, and its application in computational physics. The lecture also delves into the Fourier transform in N dimensions, image processing, and experimental techniques like TEM and STM. Additionally, it discusses filters, spectral leakage, windowing, and the analysis of microscopy images. The presentation concludes with examples of graphene and other 2D materials observed through TEM and STM.

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.