Fiveable

📚Signal Processing Unit 3 Review

QR code for Signal Processing practice questions

3.1 Definition and Derivation of Fourier Transform

3.1 Definition and Derivation of Fourier Transform

Written by the Fiveable Content Team • Last updated August 2025
Written by the Fiveable Content Team • Last updated August 2025
📚Signal Processing
Unit & Topic Study Guides

The Fourier Transform converts a continuous-time signal into a representation of its frequency content. This is one of the most fundamental operations in signal processing because it lets you analyze, filter, and manipulate signals by working with their frequency components rather than their raw time-domain samples.

The Fourier Transform

Definition and Properties

The Fourier Transform decomposes a continuous-time signal into its constituent frequencies, producing a frequency-domain representation. The forward transform maps a time-domain signal x(t)x(t) to its frequency-domain counterpart X(ω)X(\omega), where ω\omega is angular frequency in radians per second:

X(ω)=x(t)ejωtdtX(\omega) = \int_{-\infty}^{\infty} x(t)e^{-j\omega t} dt

Here, jj is the imaginary unit and ejωte^{-j\omega t} is a complex exponential that acts as a "probe" for frequency ω\omega. The integral essentially measures how much of that frequency is present in x(t)x(t).

The inverse Fourier Transform recovers the original time-domain signal from X(ω)X(\omega):

x(t)=12πX(ω)ejωtdωx(t) = \frac{1}{2\pi} \int_{-\infty}^{\infty} X(\omega)e^{j\omega t} d\omega

Notice the 12π\frac{1}{2\pi} factor in front. This normalization appears because we're using angular frequency ω\omega (radians/second). If you use ordinary frequency ff in Hz instead, the 2π2\pi factor disappears from the front but shows up inside the exponential as ej2πfte^{j2\pi ft}.

Existence and Applicability

Not every signal has a Fourier Transform. The most common sufficient condition is absolute integrability (also called the Dirichlet condition):

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

This guarantees the integral defining X(ω)X(\omega) converges to a finite value for every ω\omega.

Signals with finite energy also have well-defined Fourier Transforms:

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

A finite-energy signal might not be absolutely integrable (for example, a sinc function), but its transform still exists in the mean-square sense.

Signals like exponential decays, Gaussian pulses, and rectangular pulses all satisfy these conditions. Purely periodic signals like cos(ω0t)\cos(\omega_0 t) technically don't satisfy either condition, but their transforms can still be defined using Dirac delta functions, which you'll encounter as you go deeper.

Deriving the Fourier Transform

Definition and Properties, Fourier transform - Wikipedia

Fourier Series and Its Limitations

The Fourier Series represents a periodic signal with period TT as a sum of complex exponentials at harmonic frequencies nω0n\omega_0, where ω0=2πT\omega_0 = \frac{2\pi}{T} is the fundamental frequency. The coefficients are:

cn=1TT/2T/2x(t)ejnω0tdtc_n = \frac{1}{T} \int_{-T/2}^{T/2} x(t)e^{-jn\omega_0 t} \, dt

Each cnc_n tells you the amplitude and phase of the nn-th harmonic. The full reconstruction is x(t)=n=cnejnω0tx(t) = \sum_{n=-\infty}^{\infty} c_n e^{jn\omega_0 t}.

The limitation is that this only works for periodic signals. If a signal doesn't repeat, there's no period TT to define, and the series doesn't apply directly.

Transition from Fourier Series to Fourier Transform

The Fourier Transform can be derived by taking the Fourier Series and letting the period grow to infinity. Here's how the argument works:

  1. Start with a periodic signal of period TT and its Fourier Series coefficients cnc_n.
  2. Define XT(ω)=TcnX_T(\omega) = T \cdot c_n evaluated at ω=nω0\omega = n\omega_0. Substituting the formula for cnc_n, this gives XT(nω0)=T/2T/2x(t)ejnω0tdtX_T(n\omega_0) = \int_{-T/2}^{T/2} x(t)e^{-jn\omega_0 t} \, dt.
  3. As TT \to \infty, the fundamental frequency ω0=2πT\omega_0 = \frac{2\pi}{T} shrinks toward zero. The discrete harmonic frequencies nω0n\omega_0 become increasingly dense along the frequency axis.
  4. The spacing between adjacent harmonics, Δω=ω0\Delta\omega = \omega_0, becomes the infinitesimal dωd\omega. The summation over nn becomes an integral over ω\omega.
  5. The integration limits T/2-T/2 to T/2T/2 extend to -\infty to \infty, and you arrive at X(ω)=x(t)ejωtdtX(\omega) = \int_{-\infty}^{\infty} x(t)e^{-j\omega t} \, dt.

The key insight: the Fourier Series gives you a discrete set of frequency components (harmonics), while the Fourier Transform gives you a continuous spectrum. The transform is the natural generalization of the series to aperiodic signals.

Time vs Frequency Domains

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

Duality and Interplay

The Fourier Transform pairs every time-domain signal x(t)x(t) with a frequency-domain representation X(ω)X(\omega). These are two views of the same signal:

  • Time domain x(t)x(t): shows how the signal's amplitude changes over time.
  • Frequency domain X(ω)X(\omega): shows which frequencies are present and how strong each one is.

Operations in one domain have direct counterparts in the other. For example:

  • Time shift: delaying x(t)x(t) by t0t_0 multiplies X(ω)X(\omega) by ejωt0e^{-j\omega t_0} (changes phase, not magnitude).
  • Time scaling: compressing a signal in time spreads it out in frequency, and vice versa.
  • Convolution in time corresponds to multiplication in frequency, which is why filtering is so natural in the frequency domain.

Reversibility and Reconstruction

Because the forward and inverse transforms are both well-defined (given the existence conditions), you can freely move between domains without losing information. This is what makes frequency-domain processing practical:

  1. Transform the signal to the frequency domain using the forward Fourier Transform.
  2. Modify X(ω)X(\omega) as needed (e.g., zero out unwanted frequency ranges to filter noise).
  3. Transform back to the time domain using the inverse Fourier Transform.

The reconstructed signal is identical to what you'd get by performing the equivalent (and often much harder) operation directly in the time domain.

Physical Interpretation of the Fourier Transform

Frequency Content and Spectral Analysis

The output X(ω)X(\omega) is generally complex-valued, so it carries two pieces of information at each frequency:

  • Magnitude spectrum X(ω)|X(\omega)|: the amplitude (strength) of each frequency component.
  • Phase spectrum X(ω)\angle X(\omega): the phase offset of each frequency component.

Together, these fully characterize the signal's frequency content. Spectral analysis means examining X(ω)|X(\omega)| and X(ω)\angle X(\omega) to extract useful information. For instance, you can identify the dominant frequency of a vibrating structure, measure the bandwidth of a communication signal, or detect harmonics in an audio recording.

Applications in Signal Processing

The frequency-domain perspective enables several core signal processing tasks:

  • Filtering: Design low-pass, high-pass, or band-pass filters by selectively keeping or attenuating frequency ranges in X(ω)X(\omega). A low-pass filter, for example, sets X(ω)=0X(\omega) = 0 for ω|\omega| above some cutoff.
  • Denoising: Techniques like spectral subtraction estimate the noise spectrum and subtract it from the signal's spectrum before inverting back to the time domain.
  • Compression: Algorithms like MP3 (audio) and JPEG (images) exploit the fact that much of a signal's energy is concentrated in a relatively small number of frequency components. By discarding weak components, you achieve significant data reduction with minimal perceptual loss.

The physical meaning of ω\omega depends on context. For time-domain signals, ω\omega represents temporal frequency. For spatial signals (like images), ω\omega represents spatial frequency. The math is the same either way.