Lecture

Fourier Transform of a Digital Rectangular Window

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-406: Fundamentals of electrical circuits and systems I

This course gives you an introduction to signal processing, focusing on the Fourier transform, on signal sampling and reconstruction and the Discrete Fourier transform. ...

Description

This lecture explains how to calculate the Fourier transform of a digital rectangular window, which involves understanding geometric progressions and manipulating exponential terms to obtain the sine function. The instructor demonstrates step by step the process of deriving the Fourier transform formula and simplifying it to obtain the final result.

Instructor

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.

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Related concepts (29)

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.

Sine and cosine

In mathematics, sine and cosine are trigonometric functions of an angle. The sine and cosine of an acute angle are defined in the context of a right triangle: for the specified angle, its sine is the ratio of the length of the side that is opposite that angle to the length of the longest side of the triangle (the hypotenuse), and the cosine is the ratio of the length of the adjacent leg to that of the hypotenuse. For an angle , the sine and cosine functions are denoted simply as and .

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.

Trigonometric functions

In mathematics, the trigonometric functions (also called circular functions, angle functions or goniometric functions) are real functions which relate an angle of a right-angled triangle to ratios of two side lengths. They are widely used in all sciences that are related to geometry, such as navigation, solid mechanics, celestial mechanics, geodesy, and many others. They are among the simplest periodic functions, and as such are also widely used for studying periodic phenomena through Fourier analysis.

Related lectures (64)

Fourier Series: Approximation and Transformations

Covers the concept of Fourier series and their practical applications in signal processing.

Signal Processing Fundamentals

Covers the basics of signal processing and electric circuits.

The Sampling Theorem

Covers the sampling theorem, impulse train sampling, bandlimited signals, and the Nyquist rate.