Fourier Series & Transform

Any signal can be built from sinusoids. Learn the Fourier series of periodic signals (square wave harmonics), the Fourier transform and its properties (linearity, time shift, scaling, convolution ↔ multiplication, Parseval), spectra of common signals, bandwidth, and frequency response of LTI systems.

Joseph Fourier showed that complex waveforms are sums of simple sine waves. Looking at a signal's frequency content (its spectrum) explains bandwidth, filtering, distortion, modulation and much more.

An analogy

The Fourier transform is like a prism splitting white light into colours: a complex signal is split into the pure tones (frequencies) that make it up.

Fourier series

Periodic signals contain only harmonics of f₀. A square wave has odd harmonics falling as 1/n; a triangle wave falls as 1/n². Sharp edges need many harmonics — hence wide bandwidth.

Fourier transform

Non-periodic signals have continuous spectra. Short pulses have wide spectra (time–bandwidth trade-off). A delay adds linear phase; modulation shifts the spectrum.

Frequency response

For LTI systems, Y(f) = X(f)H(f). Magnitude |H| shows gain versus frequency; phase ∠H shows delay. Bode plots use log scales.

Practical spectra

The DFT/FFT computes spectra of sampled data; windowing controls leakage; spectrograms show how spectra change over time (speech, radar, vibration analysis).

Formulas

Worked example: Square wave harmonics

Given: 1 kHz square wave, ±1 V

Find: Amplitudes of 1st and 3rd harmonics.

Answer: 1.27 V and 0.42 V

Worked example: Pulse bandwidth

Given: 1 µs rectangular pulse

Find: First spectral null.

Answer: 1 MHz — shorter pulses need more bandwidth

Common mistakes

Applications

Key takeaways

Going further