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

  1. Linearity:
    The Fourier transform is linear:

  2. Time Shifting:
    Shifting in time results in a phase shift in the frequency domain:

  3. Frequency Shifting:
    Multiplying by a complex exponential shifts the frequency:

  4. Scaling:
    Scaling compresses or stretches the frequency domain:

  5. Parseval’s Theorem:
    The total energy in the time domain equals the total energy in the frequency domain:

  6. Duality:
    Interchanging the roles of and gives:


Fourier Transform of Common Functions

  1. Delta Function:
  2. Constant Function:
  3. Gaussian Function:
    If , then:
  4. Sine and Cosine:
    • :
    • :

Example

Function:

Let (a Gaussian).

Fourier Transform:

This result demonstrates that the Fourier transform of a Gaussian is also a Gaussian.