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

Lecture

Fourier Series and Transforms: Introduction and Properties

In course

ENG-366: Signals, instruments and systems

The goal of this course is to transmit knowledge in sensing, computing, communicating, and actuating for programmable field instruments and, more generally, embedded systems. The student will be able to put in practice the knowledge acquired using concrete ...

Description

This lecture introduces the concepts of Fourier series and Fourier transforms, explaining how any periodic function can be decomposed into sines and cosines. It covers the properties of these transforms, including linearity, translation, modulation, and scaling. The lecture also discusses the convolution operation in both time and frequency domains, highlighting its commutativity, associativity, and distributivity properties. The Discrete Fourier Transform (DFT) is presented as a discretized version of the Fourier transform, suitable for computer implementation. Examples and demonstrations using Matlab are provided to illustrate these concepts.

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

Alcherio Martinoli

I received my Diploma in Electrical Engineering from the Swiss Federal Institute of Technology in Zurich (ETHZ), and a Ph.D. in Computer Science from the Swiss Federal Institute of Technology in Lausanne (EPFL). I am currently an Associate Professor at the School of Architecture, Civil, and Environmental Engineering and the head of the Distributed Intelligent Systems and Algorithms Laboratory. Before joining EPFL I carried out research activities at the Institute of Biomedical Engineering of the ETHZ, at the Institute of Industrial Automation of the Spanish Research Council in Madrid, Spain, and at the California Institute of Technology, Pasadena, U.S.A. Additional information can be found on my full CV.

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.

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.

Fourier series

A Fourier series (ˈfʊrieɪ,_-iər) is an expansion of a periodic function into a sum of trigonometric functions. The Fourier series is an example of a trigonometric series, but not all trigonometric series are Fourier series. By expressing a function as a sum of sines and cosines, many problems involving the function become easier to analyze because trigonometric functions are well understood. For example, Fourier series were first used by Joseph Fourier to find solutions to the heat equation.

Related lectures (54)

Fourier Analysis: Fourier Series and Transform

Explores Fourier series, DFT, FFT, and their applications in signal processing and spectroscopy.

Fourier Transforms: Dirac Delta, Fourier Integral, and Transform

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

Fourier Series and Analysis

Covers Fourier series, analysis, the heat equation, Gibbs phenomenon, and Fourier transform properties.

Properties of Fourier Transform

Explores the properties and applications of the Fourier transform in signal processing and mathematics.

Signal Representations