Lecture

Fourier Transform: Basics and Examples

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

EE-205: Signals and systems (for EL)

Ce cours pose les bases d'un concept essentiel en ingénierie : la notion de système. Plus spécifiquement, le cours présente la théorie des systèmes linéaires invariants dans le temps (SLIT), qui sont largement utilisés pour modéliser aussi bien une réalité ...

Description

This lecture covers the definition of Fourier transform and Fourier transform pairs, explaining when they are well defined for different types of signals such as absolutely integrable, periodic, and finite energy signals. The instructor demonstrates the application of the Fourier transform formula through examples like the Box Function, One-Sided Exponential, and Delta Function. The lecture also explores the Fourier transform of periodic functions, showcasing how it consists of Dirac delta functions. Additionally, Fourier Transform Pairs are discussed, presenting various pairs related to continuous-time Fourier transform, including Dirac delta function, constant function, harmonics, and more.

Instructors (2)

Jean-Philippe Thiran

Jean-Philippe Thiran was born in Namur, Belgium, in August 1970. He received the Electrical Engineering degree and the PhD degree from the Université catholique de Louvain (UCL), Louvain-la-Neuve, Belgium, in 1993 and 1997, respectively. From 1993 to 1997, he was the co-ordinator of the medical image analysis group of the Communications and Remote Sensing Laboratory at UCL, mainly working on medical image analysis. Dr Jean-Philippe Thiran joined the Signal Processing Institute (ITS) of the Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland, in February 1998 as a senior lecturer. He was promoted to Assistant Professor in 2004, to Associate Professor in 2011 and is now a Full Professor since 2020. He also holds a 20% position at the Department of Radiology of the University of Lausanne (UNIL) and of the Lausanne University Hospital (CHUV) as Associate Professor ad personam. Dr Thiran's current scientific interests include Computational medical imaging: acquisition, reconstruction and analysis of imaging data, with emphasis on regularized linear inverse problems (compressed sensing, convex optimization). Applications to medical imaging: diffusion MRI, ultrasound imaging, inverse planning in radiotherapy, etc.Computer vision & machine learning: image and video analysis, with application to facial expression recognition, eye tracking, lip reading, industrial inspection, medical image analysis, etc.

Yanina Yurina Shkel

Teaching & PhD PhD Students Serhat Emre Coban, Anuj Kumar Yadav, Cemre Çadir Courses Advanced probability and applications COM-417 In this course, various aspects of probability theory are considered. The first part covers the main theorems in the field (law of large numbers, central limit theorem), while the second part focuses on the theory of martingales and concentration inequalities. Signal processing COM-202 Signal processing theory and applications: discrete and cont

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (32)

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.

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.

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.

Signal

In signal processing, a signal is a function that conveys information about a phenomenon. Any quantity that can vary over space or time can be used as a signal to share messages between observers. The IEEE Transactions on Signal Processing includes audio, video, speech, , sonar, and radar as examples of signals. A signal may also be defined as observable change in a quantity over space or time (a time series), even if it does not carry information.

Related lectures (64)

Frequency Estimation (Theory)

Covers the theory of numerical methods for frequency estimation on deterministic signals, including Fourier series and transform, Discrete Fourier transform, and the Sampling theorem.

Signal Representations

Covers the properties of signal/data representations using Fourier transformations and matrices.

Fourier Series and Transforms: Introduction and Properties

Covers Fourier series, Fourier transforms, and convolution properties, including linearity and commutativity.

Signals, Instruments, and Systems

Explores signals, instruments, and systems, covering ADC, Fourier Transform, sampling, signal reconstruction, aliasing, and anti-alias filters.

Sampling and Reconstruction Theory