Lecture

Fourier Transform and Windowing

Graph Chat

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.

In course

PHYS-332: Computational physics III

This course teaches the students practical skills needed for solving modern physics problems by means of computation. A number of examples illustrate the utility of numerical computations in various domains of physics. ...

Description

This lecture covers the concept of spectral leakage due to mismatched signal window periods, the use of window functions to enforce signal continuity, and examples of window functions like the Hann window. It also delves into Fourier transforms in N dimensions, DFT in N dimensions, image processing techniques such as noise removal using FFT, and experimental techniques like transmission electron microscopy and scanning tunneling microscopy. The lecture further explores graphene and other 2D materials, including the growth of large-area graphene samples and observations of polycrystalline graphene using TEM. Practical exercises involving TEM images of graphene and STM images of grain boundary defects are also discussed.

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

Window function

In signal processing and statistics, a window function (also known as an apodization function or tapering function) is a mathematical function that is zero-valued outside of some chosen interval, normally symmetric around the middle of the interval, usually approaching a maximum in the middle, and usually tapering away from the middle. Mathematically, when another function or waveform/data-sequence is "multiplied" by a window function, the product is also zero-valued outside the interval: all that is left is the part where they overlap, the "view through the window".

Spectral leakage

The Fourier transform of a function of time, s(t), is a complex-valued function of frequency, S(f), often referred to as a frequency spectrum. Any linear time-invariant operation on s(t) produces a new spectrum of the form H(f)•S(f), which changes the relative magnitudes and/or angles (phase) of the non-zero values of S(f). Any other type of operation creates new frequency components that may be referred to as spectral leakage in the broadest sense. Sampling, for instance, produces leakage, which we call aliases of the original spectral component.

Discrete-time Fourier transform

In mathematics, the discrete-time Fourier transform (DTFT), also called the finite Fourier transform, is a form of Fourier analysis that is applicable to a sequence of values. The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time. From uniformly spaced samples it produces a function of frequency that is a periodic summation of the continuous Fourier transform of the original continuous function.

Discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.

Graphene

Graphene (ˈgræfiːn) is an allotrope of carbon consisting of a single layer of atoms arranged in a hexagonal lattice nanostructure. The name is derived from "graphite" and the suffix -ene, reflecting the fact that the graphite allotrope of carbon contains numerous double bonds. Each atom in a graphene sheet is connected to its three nearest neighbors by σ-bonds and a delocalised π-bond, which contributes to a valence band that extends over the whole sheet.

Related lectures (64)

Image Processing I: Ordered Dithering and Fourier Transform

Explores ordered dithering and Fourier transform in image processing.

Fast Fourier Transform (FFT): Lecture 4

Covers the Fast Fourier Transform (FFT) algorithm, interpolation, filters, image processing, and experimental techniques in TEM and STM.

Properties of Time-Frequency Domain Signals

Covers the main properties of time-frequency domain signals and their limitations.

Fast Fourier Transform (FFT): Basics and Applications

Covers the Fast Fourier Transform (FFT) algorithm and its applications in computational physics, including image processing, experimental techniques, filters, and analysis of microscopy images.

Electron Microscopy: TEM