Fiveable

🔌Intro to Electrical Engineering Unit 19 Review

QR code for Intro to Electrical Engineering practice questions

19.2 Fourier transform for aperiodic signals

19.2 Fourier transform for aperiodic signals

Written by the Fiveable Content Team • Last updated August 2025
Written by the Fiveable Content Team • Last updated August 2025
🔌Intro to Electrical Engineering
Unit & Topic Study Guides

Fourier Transform for Aperiodic Signals

Definition and Properties of Aperiodic Signals

Fourier series work great for periodic signals, but most real-world signals (a single clap, a transient voltage spike, a one-time pulse) don't repeat. These are aperiodic signals, and analyzing their frequency content requires the Fourier transform instead.

  • An aperiodic signal x(t)x(t) is any signal that does not repeat periodically over time.
  • Common examples: a single rectangular pulse, a decaying exponential eatu(t)e^{-at}u(t), or a chirp signal whose frequency sweeps over time.
  • Unlike periodic signals (which have discrete frequency components at harmonics), aperiodic signals have a continuous frequency spectrum. Every frequency contributes, not just integer multiples of a fundamental.
  • Aperiodic signals carry finite total energy, calculated as:

E=x(t)2dtE = \int_{-\infty}^{\infty} |x(t)|^2 \, dt

This finite-energy requirement is what distinguishes signals suited for the Fourier transform from periodic signals, which have finite power but infinite energy.

The Fourier Transform

The Fourier transform decomposes an aperiodic time-domain signal into a continuous spectrum of frequencies. For a signal x(t)x(t), the transform is:

X(f)=x(t)ej2πftdtX(f) = \int_{-\infty}^{\infty} x(t) \, e^{-j2\pi ft} \, dt

  • X(f)X(f) is the frequency-domain representation of the signal.
  • ff is frequency (in Hz).
  • jj is the imaginary unit (j2=1j^2 = -1).

You can think of this integral as correlating x(t)x(t) with a complex exponential at each frequency ff. Where the signal has strong content at a particular frequency, X(f)X(f) will be large there.

Existence condition: The transform exists when x(t)x(t) is absolutely integrable:

x(t)dt<\int_{-\infty}^{\infty} |x(t)| \, dt < \infty

Frequency Spectrum and Continuous Spectrum

Because X(f)X(f) is generally complex-valued, it's common to split it into two parts:

  • Magnitude spectrum X(f)|X(f)|: Shows the amplitude of each frequency component. This tells you which frequencies are present and how strong they are.
  • Phase spectrum X(f)\angle X(f): Shows the phase shift of each frequency component. This tells you the relative timing between different frequency components.

Both pieces are needed to fully reconstruct the original signal. Two signals can share the same magnitude spectrum but sound or look completely different because of their phase spectra.

Inverse Fourier Transform

Definition and Properties of Aperiodic Signals, File:Fourier transform, Fourier series, DTFT, DFT.gif - Wikipedia

Definition and Properties of the Inverse Fourier Transform

The inverse Fourier transform takes you back from the frequency domain to the time domain, reconstructing x(t)x(t) from X(f)X(f):

x(t)=X(f)ej2πftdfx(t) = \int_{-\infty}^{\infty} X(f) \, e^{j2\pi ft} \, df

Notice the symmetry with the forward transform. The only differences are the sign of the exponent (+j+j instead of j-j) and that you're integrating over frequency instead of time.

The inverse transform exists when X(f)X(f) is absolutely integrable: X(f)df<\int_{-\infty}^{\infty} |X(f)| \, df < \infty.

Together, the forward and inverse transforms form a transform pair: you can move freely between domains without losing information.

Dirac Delta Function and Its Properties

The Dirac delta function δ(t)\delta(t) is a mathematical idealization that shows up constantly in Fourier analysis. It represents an infinitely narrow, infinitely tall pulse with unit area:

δ(t)dt=1\int_{-\infty}^{\infty} \delta(t) \, dt = 1

Its most useful property is the sifting property: for any continuous function g(t)g(t),

g(t)δ(tt0)dt=g(t0)\int_{-\infty}^{\infty} g(t) \, \delta(t - t_0) \, dt = g(t_0)

This "picks out" the value of gg at t0t_0.

Two key Fourier transform pairs involving the delta function:

  • F{δ(t)}=1\mathcal{F}\{\delta(t)\} = 1 (an impulse in time has equal content at all frequencies)
  • F1{1}=δ(t)\mathcal{F}^{-1}\{1\} = \delta(t) (a constant spectrum in frequency corresponds to a single impulse in time)

These pairs are useful for deriving other transforms and for modeling idealized impulse inputs to systems.

Convolution Theorem and Its Application

Convolution describes how a linear time-invariant (LTI) system processes an input signal. The convolution of x(t)x(t) and h(t)h(t) is:

(xh)(t)=x(τ)h(tτ)dτ(x * h)(t) = \int_{-\infty}^{\infty} x(\tau) \, h(t - \tau) \, d\tau

Computing this integral directly can be tedious. The convolution theorem provides a shortcut:

F{x(t)h(t)}=X(f)H(f)\mathcal{F}\{x(t) * h(t)\} = X(f) \cdot H(f)

In other words, convolution in the time domain becomes simple multiplication in the frequency domain. This is one of the most practically important results in signal processing.

To find the output of an LTI system using this theorem:

  1. Compute X(f)=F{x(t)}X(f) = \mathcal{F}\{x(t)\} (transform the input).
  2. Compute H(f)=F{h(t)}H(f) = \mathcal{F}\{h(t)\} (transform the impulse response).
  3. Multiply: Y(f)=X(f)H(f)Y(f) = X(f) \cdot H(f).
  4. Inverse transform: y(t)=F1{Y(f)}y(t) = \mathcal{F}^{-1}\{Y(f)\}.

The reverse also holds: multiplication in time corresponds to convolution in frequency.

Time-Frequency Duality

Properties and Implications of Time-Frequency Duality

Time-frequency duality refers to the deep symmetry between the time and frequency domains. Operations you perform in one domain have direct counterparts in the other. Recognizing these pairs saves a lot of work because you can often derive a new result by applying duality to one you already know.

Here are the most important duality relationships:

Time-Domain OperationFrequency-Domain Counterpart
Scaling: x(at)x(at)1aX ⁣(fa)\frac{1}{\lvert a \rvert} X\!\left(\frac{f}{a}\right)
Time shift: x(tt0)x(t - t_0)ej2πft0X(f)e^{-j2\pi f t_0} X(f)
Convolution: x(t)h(t)x(t) * h(t)X(f)H(f)X(f) \cdot H(f)
Multiplication: x(t)h(t)x(t) \cdot h(t)X(f)H(f)X(f) * H(f)

A few things to notice:

  • Scaling tradeoff: Compressing a signal in time (making it shorter) spreads its spectrum wider in frequency, and vice versa. A very narrow pulse has a very wide bandwidth. This is a fundamental constraint you'll encounter repeatedly in communications and signal processing.
  • Time shift → phase shift: Shifting a signal in time doesn't change which frequencies are present (the magnitude spectrum stays the same), it only changes when they arrive (the phase spectrum shifts linearly with frequency).
  • Convolution ↔ multiplication: This pair is the convolution theorem from the previous section, stated in both directions.

These duality properties make the Fourier transform especially powerful for circuit and system analysis, because difficult operations in one domain often become straightforward operations in the other.