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

Lecture

DFT definition: Fourier Basis and Basis Expansion

Description

This lecture introduces the Discrete Fourier Transform (DFT) and its definition using the Fourier Basis for Complex Numbers. It covers the basis expansion in both signal and vector notations, the analysis and synthesis formulas, and the change of basis in matrix form. The lecture also explains the N-point signal representation in the frequency and time domains.

Official source

Ontological neighbourhood

Mathematics

Algebra: Linear algebra

Information engineering

Signal processing: Fourier analysis

Related concepts (27)

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.

Frequency domain

In mathematics, physics, electronics, control systems engineering, and statistics, the frequency domain refers to the analysis of mathematical functions or signals with respect to frequency, rather than time. Put simply, a time-domain graph shows how a signal changes over time, whereas a frequency-domain graph shows how the signal is distributed within different frequency bands over a range of frequencies. A frequency-domain representation consists of both the magnitude and the phase of a set of sinusoids (or other basis waveforms) at the frequency components of the signal.

Related lectures (45)

Discrete Fourier series: Inherent periodicities and time shifts

Explores the Discrete Fourier Transform synthesis and analysis formulas, time shifts for finite-length signals, and the equivalence between DFS and DFT.

Numerical Methods: Boundary Value Problems

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

Discrete Fourier Transform: Frequency Periodicity and Reconstruction

Explores frequency periodicity in the discrete Fourier transform for signal reconstruction.

Fourier Analysis: Fourier Series and Transform

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

Signal Representation: Fourier Transforms