- categories: Functional analysis, Definition, Signal processing
Definition
The Fourier Transform is a mathematical operation that transforms a function of time (or space) into its frequency-domain representation. For a function , its Fourier Transform is defined as:
where:
- is the time (or spatial) variable,
- is the angular frequency,
- represents the complex sinusoidal basis functions.
Inverse Fourier Transform
The original function can be recovered from its Fourier transform using the inverse Fourier transform:
Key Properties
-
Linearity:
The Fourier transform is linear: -
Time Shifting:
Shifting in time results in a phase shift in the frequency domain: -
Frequency Shifting:
Multiplying by a complex exponential shifts the frequency: -
Scaling:
Scaling compresses or stretches the frequency domain: -
Parseval’s Theorem:
The total energy in the time domain equals the total energy in the frequency domain: -
Duality:
Interchanging the roles of and gives:
Fourier Transform of Common Functions
- Delta Function:
- Constant Function:
- Gaussian Function:
If , then: - Sine and Cosine:
- :
- :
Example
Function:
Let (a Gaussian).
Fourier Transform:
This result demonstrates that the Fourier transform of a Gaussian is also a Gaussian.