Fourier Series Study Guide

Introduction to Fourier Series

Fourier Series is a mathematical tool that decomposes periodic functions into a sum of simple oscillating functions, namely sines and cosines. Named after Jean-Baptiste Joseph Fourier (1768-1830), this technique is fundamental in electrical engineering for analyzing signals and systems.

Key Concepts

Any periodic function can be represented as an infinite sum of sine and cosine functions
Critical for analyzing linear time-invariant (LTI) systems in electrical engineering
Foundation for Fourier Transform used in signal processing
Essential for understanding frequency domain analysis

Mathematical Foundation

General Form of Fourier Series

f(t) = a₀ + ∑_n=1^∞ [aₙ cos(nω₀t) + bₙ sin(nω₀t)]

Where:

a₀ = DC component (average value over one period)
aₙ, bₙ = Fourier coefficients for cosine and sine terms
ω₀ = Fundamental angular frequency (ω₀ = 2π/T)
T = Period of the function

Fourier Coefficients

a₀ = (1/T) ∫₀^T f(t) dt

aₙ = (2/T) ∫₀^T f(t) cos(nω₀t) dt

bₙ = (2/T) ∫₀^T f(t) sin(nω₀t) dt

Derivation of Fourier Coefficients

The coefficients are derived using orthogonality properties of sine and cosine functions:

∫₀^T cos(mω₀t) cos(nω₀t) dt = { T/2 if m=n≠0, T if m=n=0, 0 otherwise }

∫₀^T sin(mω₀t) sin(nω₀t) dt = { T/2 if m=n≠0, 0 otherwise }

∫₀^T sin(mω₀t) cos(nω₀t) dt = 0 for all m,n

By multiplying both sides of the Fourier series equation by cos(nω₀t) or sin(nω₀t) and integrating over one period, we can solve for the coefficients.

Interactive Fourier Series Visualization

Adjust the number of terms in the Fourier series to see how the approximation improves. This demonstrates the square wave approximation using Fourier series.

Number of Terms (N): 5

Wave Type:

Frequency (Hz): 2 Hz

f(t) = (4/π) [sin(ωt) + (1/3)sin(3ωt) + (1/5)sin(5ωt) + ...]

Explanation: The square wave approximation shows the Gibbs phenomenon - overshoot at discontinuities that doesn't disappear even with many terms.

Applications in Electrical Engineering

Signal Processing Intermediate

Fourier series is fundamental in signal processing for:

Filter design: Analyzing frequency response of filters
Signal analysis: Breaking down complex signals into frequency components
Modulation: Understanding AM, FM, and other modulation techniques
Noise reduction: Isolating and removing unwanted frequency components

Power Systems Beginner

In power engineering, Fourier series helps with:

Analyzing harmonic distortion in AC power systems
Designing power filters to reduce harmonics
Understanding power quality issues
Analyzing non-sinusoidal voltage and current waveforms

Communications Advanced

Fourier analysis is crucial in communication systems for:

Frequency domain representation of signals
Understanding bandwidth requirements
Designing multiplexing systems (FDM)
Analyzing signal integrity and distortion

Real-World Example: Power System Harmonics

In power systems, non-linear loads like computers and LED lights create harmonics (multiples of the fundamental 50/60 Hz frequency). These harmonics can cause overheating in transformers and motors. Fourier series analysis helps identify the amplitude of each harmonic, allowing engineers to design appropriate filters.

Examples and Problem Solving

Example 1: Fourier Series of a Square Wave

Find the Fourier series for the following square wave with period T = 2π:

f(t) = { 1, 0 < t < π; -1, π < t < 2π }

Solution: Since the function is odd (f(-t) = -f(t)), all aₙ coefficients will be zero.

bₙ = (2/π) ∫₀^π sin(nt) dt = (2/π) [-cos(nt)/n]₀^π

bₙ = (2/(nπ)) [1 - cos(nπ)] = { 4/(nπ) if n is odd, 0 if n is even }

Thus, the Fourier series is:

f(t) = (4/π) [sin(t) + (1/3)sin(3t) + (1/5)sin(5t) + ...]

Example 2: RC Circuit Response

An RC circuit with R = 1kΩ and C = 1μF has a square wave input voltage with amplitude 5V and frequency 1kHz. Find the output voltage using Fourier series.

Approach:

Express input square wave as Fourier series
Find transfer function H(ω) = V_out/V_in = 1/(1 + jωRC)
Apply each frequency component through the transfer function
Sum all output components to get the total response

This demonstrates how Fourier series simplifies analysis of linear systems to sinusoidal inputs.

Properties and Theorems

Symmetry Properties

Even functions (f(t) = f(-t)): Only cosine terms exist (bₙ = 0)
Odd functions (f(t) = -f(-t)): Only sine terms exist (aₙ = 0)
Half-wave symmetry (f(t) = -f(t+T/2)): Only odd harmonics exist

Important Theorems

Parseval's Theorem

Relates the power in time domain to the power in frequency domain:

(1/T) ∫₀^T |f(t)|² dt = a₀² + (1/2) ∑_n=1^∞ (aₙ² + bₙ²)

This is particularly useful in signal processing for calculating the power of a signal from its Fourier coefficients.

Linearity Property

If f(t) and g(t) have Fourier series with coefficients aₙ, bₙ and cₙ, dₙ respectively, then the Fourier series of αf(t) + βg(t) has coefficients αaₙ + βcₙ and αbₙ + βdₙ.

This property is essential for analyzing linear systems where superposition applies.

Time Shifting Property

If f(t) has Fourier coefficients aₙ and bₙ, then f(t - t₀) has coefficients:

aₙ' = aₙ cos(nω₀t₀) + bₙ sin(nω₀t₀)

bₙ' = bₙ cos(nω₀t₀) - aₙ sin(nω₀t₀)

This property shows that time shifting introduces phase shifts in the frequency components.