Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Signals & Systems I: Fourier Transform and Dirac Pulse

In course

MICRO-310(b): Signals and systems I (for SV)

Présentation des concepts et des outils de base pour l'analyse et la caractérisation des signaux, la conception de systèmes de traitement et la modélisation linéaire de systèmes pour les étudiants en sciences de la vie. Application de ces techniques au tra ...

Description

This lecture covers the Fourier transformation, definition of the sign function, and the Dirac pulse train. It delves into the properties of the sign function, its Fourier transformation, and the application of scaling the Dirac pulse. The lecture also explores the development in series of Fourier, convergence of the Fourier series, and periodization with a Dirac comb. Additionally, it discusses the interpretation of Fourier series, convolutional shift, and the synthesis of a periodic signal using simple generators.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructor

Michaël Unser

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Fourier analysis

In mathematics, Fourier analysis (ˈfʊrieɪ,_-iər) is the study of the way general functions may be represented or approximated by sums of simpler trigonometric functions. Fourier analysis grew from the study of Fourier series, and is named after Joseph Fourier, who showed that representing a function as a sum of trigonometric functions greatly simplifies the study of heat transfer. The subject of Fourier analysis encompasses a vast spectrum of mathematics.

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.

Convolution

In mathematics (in particular, functional analysis), convolution is a mathematical operation on two functions (f and g) that produces a third function () that expresses how the shape of one is modified by the other. The term convolution refers to both the result function and to the process of computing it. It is defined as the integral of the product of the two functions after one is reflected about the y-axis and shifted. The choice of which function is reflected and shifted before the integral does not change the integral result (see commutativity).

Fractional Fourier transform

In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a family of linear transformations generalizing the Fourier transform. It can be thought of as the Fourier transform to the n-th power, where n need not be an integer — thus, it can transform a function to any intermediate domain between time and frequency. Its applications range from filter design and signal analysis to phase retrieval and pattern recognition.

Related lectures (36)

Fourier Transforms: Properties and Applications

Explores Fourier transforms, including properties, convolution, Parseval's theorem, and energy spectral density for non-periodic functions.

Fourier Transforms: Dirac Delta, Fourier Integral, and Transform

Explores the Dirac delta, Fourier integral, and Fourier transform applications in solving PDE problems.

Spectral Properties of Fourier Series and Fourier Transforms

Explores the motivation behind Fourier series and transforms, their fundamentals, and applications in solving differential equations.

Fourier Transform Applications: Image Processing Basics

Covers image processing basics, Fourier transformation, convolution, cross-correlation, and 3D reconstruction using the Radon projection theorem.

Properties of Fourier and inverse Fourier transforms