Signals and Systems

Fourier Analysis: Deconstructing Signals

Imron Rosyadi

Signals and Systems

Fourier Analysis: Deconstructing Signals

Imron Rosyadi

1. The Power of Complex Exponentials

Recall from our previous discussion that complex exponentials are eigenfunctions of LTI systems.

Continuous-Time \(x(t) = e^{st} \quad \xrightarrow{\text{LTI System}} \quad y(t) = H(s) e^{st}\)

Discrete-Time \(x[n] = z^n \quad \xrightarrow{\text{LTI System}} \quad y[n] = H(z) z^n\)

This means:

  • LTI systems only scale complex exponentials, they don’t change their fundamental form.
  • The system’s behavior is fully characterized by \(H(s)\) or \(H(z)\) at specific values of \(s\) or \(z\).

The BIG Question: If we can represent any signal as a sum (or integral) of these simple complex exponentials, then analyzing complex LTI systems becomes a simple matter of multiplication.

This is exactly what Fourier Analysis enables!

2. A Glimpse into History: Joseph Fourier

Joseph Fourier (1768-1830)

Mathematica, quae ad calorem deduxi, sunt mihi graviora. (The mathematics that I have derived concerning heat, are to me of greater importance.) — Joseph Fourier

  • French mathematician and physicist.
  • Best known for initiating the investigation of Fourier series and their applications to problems of heat transfer and vibrations.
  • Original Motivation: Solving the one-dimensional heat equation (1807). He proposed that any continuous function could be represented as a sum of sines and cosines.
  • Controversial Idea: His assertion that any function could be represented as such was highly controversial among his peers (Lagrange, Laplace), as the concept of “function” was very narrow at the time.

Impact: Revolutionized mathematics and physics, enabling frequency-domain analysis.

3. Fourier Series: Representing Periodic Signals

The Fourier Series allows us to represent a periodic signal \(x(t)\) with period \(T_0\) (and fundamental frequency \(\omega_0 = 2\pi/T_0\)) as a weighted sum of harmonically related complex exponentials.

3.1 Complex Exponential Fourier Series

\[ x(t) = \sum_{k=-\infty}^{\infty} c_k e^{jk\omega_0 t} \] where the coefficients \(c_k\) are given by: \[ c_k = \frac{1}{T_0} \int_{T_0} x(t) e^{-jk\omega_0 t} dt \] (The integral is over any single period \(T_0\)).

3. Fourier Series: Representing Periodic Signals

3.2 Trigonometric Fourier Series (Alternative Form)

\[ x(t) = a_0 + \sum_{k=1}^{\infty} (a_k \cos(k\omega_0 t) + b_k \sin(k\omega_0 t)) \] where \(a_0 = c_0 = \frac{1}{T_0} \int_{T_0} x(t) dt\) and \(c_k = \frac{1}{2}(a_k - jb_k)\). (For real signals: \(a_k = 2 \text{Re}\{c_k\}\), \(b_k = -2 \text{Im}\{c_k\}\)).

Key Idea: Any periodic signal can be decomposed into a sum of a DC component, a fundamental frequency component, and components at integer multiples (harmonics) of the fundamental frequency.

4. Interactive Demo: Fourier Series Synthesis of a Square Wave

Let’s synthesize a square wave by summing its Fourier Series components. A square wave is rich in odd harmonics.

\[ x(t)_{\text{square}} = \frac{4}{\pi} \sum_{k \text{ odd}, k \ge 1} \frac{1}{k} \sin(k\omega_0 t) \]

Adjust the number of Harmonics to see how well the approximation matches the ideal square wave.

5. Fourier Transform: For Aperiodic Signals

Fourier Series applies only to periodic signals. What about non-periodic, transient signals? The Fourier Transform (FT) extends this concept to aperiodic signals.

5.1 From Fourier Series to Fourier Transform (Conceptual)

Imagine a periodic signal whose period \(T_0\) approaches infinity (\(T_0 \to \infty\)). As \(T_0 \to \infty\):

  • The fundamental frequency \(\omega_0 = 2\pi/T_0 \to 0\).
  • The discrete sum over harmonics becomes a continuous integral over frequency.
  • The Fourier coefficients \(c_k\) become a continuous function of frequency, \(X(j\omega)\).

5. Fourier Transform: For Aperiodic Signals

5.2 The Fourier Transform Pair

Forward Fourier Transform: Transforms a time-domain signal \(x(t)\) into its frequency-domain representation \(X(j\omega)\). \[ X(j\omega) = \int_{-\infty}^{\infty} x(t) e^{-j\omega t} dt \]

Inverse Fourier Transform: Transforms a frequency-domain spectrum \(X(j\omega)\) back into its time-domain signal \(x(t)\). \[ x(t) = \frac{1}{2\pi} \int_{-\infty}^{\infty} X(j\omega) e^{j\omega t} d\omega \]

Interpretation: \(X(j\omega)\) is the spectrum of the signal \(x(t)\), showing how much of each frequency \(\omega\) is present in the signal.

6. Key Properties of the Fourier Transform in LTI Systems

The FT reveals powerful properties crucial for ECE:

  1. Linearity: If \(\mathcal{F}\{x_1(t)\} = X_1(j\omega)\) and \(\mathcal{F}\{x_2(t)\} = X_2(j\omega)\), then \(\mathcal{F}\{ax_1(t) + bx_2(t)\} = aX_1(j\omega) + bX_2(j\omega)\)

  2. Time Shift: If \(\mathcal{F}\{x(t)\} = X(j\omega)\), then \(\mathcal{F}\{x(t-t_0)\} = e^{-j\omega t_0} X(j\omega)\) (A time shift in the time domain corresponds to a phase shift in the frequency domain).

  3. Convolution Property (THE MOST IMPORTANT FOR LTI): If \(y(t) = x(t) * h(t)\) (convolution in time domain), then \(\mathcal{F}\{y(t)\} = Y(j\omega) = X(j\omega) H(j\omega)\) (Convolution in time domain becomes multiplication in frequency domain!)

    Here, \(H(j\omega) = \mathcal{F}\{h(t)\}\) is the frequency response of the LTI system.

6. Key Properties of the Fourier Transform in LTI Systems

graph TD
    A[Time Domain] -- "Convolution: x(t) * h(t)" --> B["Time Domain Result: y(t)"]

    C[Frequency Domain] -- "FT: X(jω), H(jω)" --> D["Frequency Domain Result: Y(jω)"]

    A -- FT --> C
    B -- FT --> D
  
    C -- Multiplication: X(jω) * H(jω) --> D

    style A fill:#a2c4c9,stroke:#333,stroke-width:2px;
    style B fill:#a2c4c9,stroke:#333,stroke-width:2px;
    style C fill:#fce5cd,stroke:#333,stroke-width:2px;
    style D fill:#fce5cd,stroke:#333,stroke-width:2px;

    linkStyle 0 stroke:#666,stroke-width:2px;
    linkStyle 1 stroke:#333,stroke-width:3px,color:red;
    linkStyle 2 stroke:#666,stroke-width:2px;
    linkStyle 3 stroke:#666,stroke-width:2px;
    linkStyle 4 stroke:#333,stroke-width:3px,color:blue;

7. Interactive Demo: Filtering in the Frequency Domain

Let’s apply a simple Low-Pass Filter (LPF) to a signal composed of two sine waves with different frequencies.

Observe:

  1. The input signal’s time-domain plot and its frequency spectrum.
  2. The filter’s frequency response (magnitude).
  3. The output signal’s time-domain plot and its frequency spectrum.

Adjust the Cutoff Frequency of the filter. See how the filter attenuates higher frequencies while passing lower frequencies.

8. ECE Applications of Fourier Analysis

Fourier Analysis is fundamental to almost every area of Electrical and Computer Engineering.

1. Communication Systems

  • Modulation/Demodulation: Shifting a signal’s spectrum to a different carrier frequency for transmission (radio, WiFi).
  • Multiplexing: Combining multiple signals into one channel by allocating different frequency bands.
  • Spectrum Analysis: Understanding bandwidth requirements, interference.

2. Audio & Speech Processing

  • Equalizers: Boosting or cutting specific frequency ranges.
  • Noise Reduction: Filtering out unwanted frequency components.
  • Compression (e.g., MP3): Discarding inaudible frequency components.

3. Image & Video Processing

  • Filtering: Sharpening (high-pass), blurring (low-pass), edge detection.
  • Compression (e.g., JPEG): Representing images efficiently in the frequency domain.

8. ECE Applications of Fourier Analysis

4. Circuit Analysis

  • AC Steady-State Analysis: Transforming differential equations into algebraic equations in the frequency domain (phasors).
  • Filter Design: Designing circuits that pass or block specific frequencies (e.g., Butterworth, Chebyshev filters).

5. Control Systems

  • Frequency Response Analysis: Assessing system stability and performance by analyzing how different input frequencies are processed.
  • System Identification: Determining a system’s characteristics by observing its response to various frequencies.

6. Digital Signal Processing (DSP)

  • Discrete Fourier Transform (DFT) / Fast Fourier Transform (FFT): Efficient algorithms for computing the FT on discrete (sampled) data, enabling real-time applications.

9. Conclusion: The Ubiquity of Fourier

  • Decomposition: Fourier analysis provides a powerful framework to decompose complex signals into simpler, understandable frequency components (complex exponentials).
  • Simplification: It transforms complex time-domain operations (like convolution) into simpler frequency-domain operations (like multiplication) for LTI systems.
  • Insight: It offers deep insights into phenomena related to frequency, resonance, filtering, and system behavior.

In essence, Fourier Analysis is the lens through which engineers view and manipulate signals and systems in the frequency domain.

It is a cornerstone of modern electrical and computer engineering, underpinning technologies from your smartphone to medical imaging, and from radar to robotics.

9. Conclusion: The Ubiquity of Fourier

graph TD
    A[Complex Time-Domain Signal] --> B{Fourier Transform}
    B --> C[Simple Frequency Components]
    C --> D["LTI System Analysis: Multiplication by H(jω)"]
    D --> E[Output Frequency Components]
    E --> F{Inverse Fourier Transform}
    F --> G[System Output in Time-Domain]

    style A fill:#DDA0DD,stroke:#333,stroke-width:2px;
    style G fill:#DDA0DD,stroke:#333,stroke-width:2px;
    style C fill:#ADD8E6,stroke:#333,stroke-width:2px;
    style E fill:#ADD8E6,stroke:#333,stroke-width:2px;
    style B fill:#8FBC8F,stroke:#333,stroke-width:2px;
    style F fill:#8FBC8F,stroke:#333,stroke-width:2px;
    style D fill:#F4A460,stroke:#333,stroke-width:2px;