Fast Fourier Transform (FFT): Lecture 4

In course

Reprehenderit exercitation reprehenderit proident esse deserunt nostrud adipisicing id non minim. Nulla laboris sunt eiusmod qui deserunt cillum nulla officia adipisicing in. Ipsum occaecat laboris eu cillum do commodo et nulla minim est. Est in sunt cupidatat deserunt culpa veniam ea consequat nisi est. Voluptate veniam minim pariatur ipsum. Voluptate veniam consequat mollit cupidatat ad culpa ad sit. Exercitation cillum velit labore in pariatur laborum dolor minim velit culpa.

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