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

Lecture

Untitled

Official source

https://switch-video-production.os.zhdk.cloud.switch.ch/5bd8/cdd6/074498bb68092dd64fd4/h264-1080p.mp4?X-Amz-Algorithm=AWS4-HMAC-SHA256&X-Amz-Credential=c70ce910fb73491f9933421af7a4fcee%2F20240725%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Date=20240725T143529Z&X-Amz-Expires=86400&X-Amz-SignedHeaders=host&X-Amz-Signature=3395ceaab7a5a327710ba33e76e5bfc71019625c0d1da4147d99c044a4d75cde

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (20)

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.

Oxford

Oxford (ˈɒksfərd) is a city in England. It is the county town and only city of Oxfordshire. It had a population of 162,100 at the 2021 census. It is north-west of London, south-east of Birmingham and north-east of Bristol. The city is home to the University of Oxford, the oldest university in the English-speaking world; it has buildings in every style of English architecture since late Anglo-Saxon. Oxford's industries include motor manufacturing, education, publishing, information technology and science.

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-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.

Related lectures (30)

Numerical Methods: Boundary Value Problems

Covers numerical methods for solving boundary value problems using Crank-Nicolson and FFT.

The fast Fourier transform

Explores the history and efficiency of the fast Fourier transform algorithm, demonstrating its practical applications and computational advantages.

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.

Discrete Signals & Fourier Transform

Explores discrete signals, Fourier transform, modulation, convolution, DFT properties, and signal periodicity.

Fourier Series and Analysis