Topic

 

Fourier Analysis

In mathematics, Fourier analysis 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.

Today, the subject of Fourier analysis encompasses a vast spectrum of mathematics. In the sciences and engineering, the process of decomposing a function into oscillatory components is often called Fourier analysis, while the operation of rebuilding the function from these pieces is known as Fourier synthesis. For example, determining what component frequencies are present in a musical note would involve computing the Fourier transform of a sampled musical note. One could then re-synthesize the same sound by including the frequency components as revealed in the Fourier analysis. In mathematics, the term Fourier analysis often refers to the study of both operations.

The decomposition process itself is called a Fourier transformation. Its output, the Fourier transform, is often given a more specific name, which depends on the domain and other properties of the function being transformed. Moreover, the original concept of Fourier analysis has been extended over time to apply to more and more abstract and general situations, and the general field is often known as harmonic analysis. Each transform used for analysis has a corresponding inverse transform that can be used for synthesis.

from Fourier Analysis - Wikipedia

This topic includes the following resources and journeys:

 

 

Discrete Fourier Transform

MathWorks
Intermediate
Article / Blog
Theory

The discrete Fourier transform, or DFT, is the primary tool of digital signal processing. The foundation of the product is the fast Fourier transform (FFT), a method for computing the DFT...

See More

MATLAB Function: ztrans

MathWorks
Intermediate
Software
Application

ztrans(f) finds the Z-Transform of f. By default, the independent variable is n and the transformation variable is z. If f does not contain n, ztrans uses symvar. 

See More

Understanding the Z-Transform

MathWorks - Brian Douglas
20 min
Beginner
Video
Theory

 

This intuitive introduction shows the mathematics behind the Z-transform and compares it to its similar cousin, the discrete-time Fourier transform. Mathematically, the Z-transform is...

See More

Computing the DFT Matrix

Steve Brunton
7 min
Beginner
Video
Theory

This video discusses how to compute the Discrete Fourier Transform (DFT) matrix in Matlab and Python. In practice, the DFT should usually be computed using the fast Fourier transform (FFT)...

See More

The Taylor Series

Christopher Lum
84 min
Beginner
Video
Theory

In this video we discuss the Taylor Series (and the closely related Maclaurin Series). These are two specific types of Power Series that allow you to approx...

See More

Complex Fourier Series

Steve Brunton
12 min
Intermediate
Video
Theory

This video will describe how the Fourier Series can be written efficiently in complex variables.

See More

The Fast Fourier Transform (FFT)

Steve Brunton
8 min
Beginner
Video
Application

Here I introduce the Fast Fourier Transform (FFT), which is how we compute the Fourier Transform on a computer. The FFT is one of the most important algorithms of all time.

See More

Fourier Series: Part 2

Steve Brunton
6 min
Beginner
Video
Theory

This video will show how to approximate a function with a Fourier series, which is an infinite sum of sines and cosines. We will discuss how these sines and cosines form a basis for the...

See More

The Discrete Fourier Transform (DFT)

Steve Brunton
17 min
Beginner
Video
Application

This video introduces the Discrete Fourier Transform (DFT), which is how to numerically compute the Fourier Transform on a computer. The DFT, along with its fast FFT implementation, is one...

See More