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

Lecture

Fourier Transform: Circuit Analysis

In course

EE-111: Circuits and systems

Ce cours présente une introduction à la théorie et aux méthodes d'analyse et de résolution des circuits électriques. ...

Description

This lecture covers the Fourier transform applied to circuit analysis, including properties such as linearity, time scaling, frequency displacement, differentiation, and integration. It also explores convolution product, pairs of Fourier transforms, and the application to circuits.

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

Farhad Rachidi-Haeri

Farhad Rachidi (IEEE Fellow, EMP Fellow, Electromagnetics Academy Fellow) was born in Geneva in 1962. He received the M.S. degree in electrical engineering and the Ph.D. degree from the Swiss Federal Institute of Technology, Lausanne, in 1986 and 1991 respectively. He worked at the Power Systems Laboratory of the same institute until 1996 and had several short stays at the University of Florida and the NASA Kennedy Space Center. In 1997, he joined the Lightning Research Laboratory of the University of Toronto in Canada and from April 1998 until September 1999, he was with Montena EMC in Switzerland. He is currently a titular professor and the head of the EMC Laboratory at the Swiss Federal Institute of Technology, Lausanne, Switzerland. His research interests concern electromagnetic compatibility, lightning electromagnetics and electromagnetic field interactions with transmission lines. Dr. Rachidi is currently a member of the Advisory Board of the IEEE TRANSACTIONS ON ELECTROMAGNETIC COMPATIBILITY and the President of the Swiss National Committee of the International Union of Radio Science. He has received numerous awards including the 2005 IEEE EMC Technical Achievement Award, the 2005 CIGRE Technical Committee Award, the 2006 Blondel Medal from the French Association of Electrical Engineering, Electronics, Information Technology and Communication (SEE), the 2016 Berger Award from the International Conference on Lightning Protection, the 2016 Best Paper Award of the IEEE Transactions on EMC, and the 2017 Motohisa Kanda Award for the most cited paper of the IEEE Transactions on EMC (2012-2016). In 2014, he was conferred the title of Honorary Professor of the Xi’an Jiaotong University in China. He served as the Vice-Chair of the European COST Action on the Physics of Lightning Flash and its Effects from 2005 to 2009, the Chairman of the 2008 European Electromagnetics International Symposium, the President of the International Conference on Lightning Protection from 2008 to 2014, the Editor-in-Chief of the Open Atmospheric Science Journal (2010-2012) and the Editor-in-Chief of the IEEE TRANSACTIONS ON ELECTROMAGNETIC COMPATIBILITY from 2013 to 2015. He is a Fellow of the IEEE and of the SUMMA Foundation, and a member of the Swiss Academy of Sciences. He is the author or coauthor of over 200 scientific papers published in peer-reviewed journals and over 400 papers presented at international conferences.

Official source

Ontological neighbourhood

Information engineering

Signal processing: Fourier analysis

Physics

Electromagnetism: Electrical networks

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.

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.

Fractional Fourier transform

In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a family of linear transformations generalizing the Fourier transform. It can be thought of as the Fourier transform to the n-th power, where n need not be an integer — thus, it can transform a function to any intermediate domain between time and frequency. Its applications range from filter design and signal analysis to phase retrieval and pattern recognition.

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.

Related lectures (52)

Signal Representation: Fourier Transforms

Covers the representation of signals using Fourier transforms and the properties of signal vectors.

Numerical Methods: Boundary Value Problems

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

Fourier Transforms: Properties and Applications

Explores Fourier transforms, including properties, convolution, Parseval's theorem, and energy spectral density for non-periodic functions.

Fourier Transform Applications: Image Processing Basics

Covers image processing basics, Fourier transformation, convolution, cross-correlation, and 3D reconstruction using the Radon projection theorem.

Properties of Fourier Transform