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

Lecture

Fourier Transformation: Fundamentals

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 fundamentals of the Fourier transformation, including decreasing causal exponential signals, functions of the Schwartz class, Parseval relation, weak convergence, and the Fourier transformation in the sense of distributions. It also discusses the classical framework for the Fourier transformation, the Schwartz class of functions, and the invertibility of the Fourier transformation. The lecture explores the concept of distributions, scalar products, and the generalized Fourier transformation. Additionally, it delves into the change of scale, fundamental properties, and the definition of the Fourier transformation in the sense of distributions, with a practical application on the scaling of the Dirac pulse.

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

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.

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.

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.

Normal distribution

In statistics, a normal distribution or Gaussian distribution is a type of continuous probability distribution for a real-valued random variable. The general form of its probability density function is The parameter is the mean or expectation of the distribution (and also its median and mode), while the parameter is its standard deviation. The variance of the distribution is . A random variable with a Gaussian distribution is said to be normally distributed, and is called a normal deviate.

Probability distribution

In probability theory and statistics, a probability distribution is the mathematical function that gives the probabilities of occurrence of different possible outcomes for an experiment. It is a mathematical description of a random phenomenon in terms of its sample space and the probabilities of events (subsets of the sample space). For instance, if X is used to denote the outcome of a coin toss ("the experiment"), then the probability distribution of X would take the value 0.5 (1 in 2 or 1/2) for X = heads, and 0.

Related lectures (41)

Signal Representations

Covers matrix operations, Fourier transformations, Gaussian models, and signal representations using algebraic methods.

Generalization Error

Discusses mutual information, data processing inequality, and properties related to leakage in discrete systems.

Compression: Prediction

Covers the concepts of compression and prediction using prefix-free codes and distributions.

Probability and Statistics

Covers probability distributions, moments, and continuous random variables.

Compression