Lecture

Fast Fourier Transform (FFT): Lecture 4

In course

Sit et Lorem anim deserunt. Ex mollit aliquip commodo culpa. Do voluptate reprehenderit nisi exercitation veniam ipsum do ad. Amet aliquip ipsum dolore eiusmod. Est sit amet ullamco dolore culpa aute elit. Sunt labore sunt consectetur consectetur eiusmod et aliqua laboris aliqua velit consectetur sint aliquip.

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

https://mediaspace.epfl.ch/media/0_tiummswi

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.

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis, Filtering theory

Chemical engineering

Nanotechnology: Topics in nanotechnology

Related lectures (48)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.