Previous SPTK Post: The Fourier Series Next SPTK Post: Linear Systems

This post in the Signal Processing Toolkit series deals with a key mathematical tool in CSP: The Fourier transform. Let’s try to see how the Fourier transform arises from a limiting version of the Fourier series.

[Jump straight to ‘Significance of the Fourier Transform in CSP’ below.]

The complex form of the Fourier series is used to represent an arbitrary signal on some finite interval . The idea of representation just means that the signal is equal to the sum of weighted basis functions (‘building-block functions’). The sum may have a finite or infinite number of terms, and the convergence of the sum is generally good at all points in the interval except those points corresponding to step-like discontinuities, or points that correspond to an impulse function, etc. We won’t belabor the details of the convergence and the strict mathematical properties that a signal must possess to ensure solid point-wise convergence. This is the CSP Blog, so we’re mathematical, but our focus is on building intuition so that the tools in the CSP and SPTK toolkits can be better wielded by signal-processing practitioners.

The motivation for looking for another kind of representation is that we would like to represent signals on an arbitrary interval, including an infinite interval. The essential notion of this post is that we will let the Fourier series interval approach in a semi-careful way.

Let’s write down the complex Fourier series as our starting point. We have some complex-valued signal defined on the interval and the Fourier series represents it in terms of the sum of weighted complex-valued sine waves , where is the index into the basis functions, and also serves as the harmonic number for the fundamental frequency . We have the representation

where the Fourier coefficients are the , the Fourier frequencies are , and the coefficients are computed by

Now let’s substitute (2) into (1) to yield

where I changed the variable of integration from to in (2) to avoid confusion. Now, let’s denote the fundamental by and reexpress (3) in terms of ,

As grows, becomes an infinitesimal number, which we’ll call . The number takes on values on an increasingly fine grid that extends to infinity, because the lower and upper limits on are infinite. The following movie illustrates the behavior of the Fourier frequencies and Fourier coefficient magnitudes for a fixed-width rectangle signal as the interval of representation gets larger and larger. Note the ever-finer spacing of the Fourier frequencies.

The sum over in (4) passes to a conventional integral, and we write it as

or

We call the inner integral, which is a function of frequency , the *Fourier transform* of :

and we can see that the outer integral is a reverse, or *inverse Fourier transform*

In engineering, the Fourier transform of a signal is often denoted by a upper-case letter and a time function is denoted by a lower-case letter. A thick double-sided arrow is often used to denote a Fourier-transform relationship, or *Fourier-transform pair*:

### Interpretation

The signal is composed of an infinity of sine-wave components, each with infinitesimal strength. The strengths are given by and the frequencies are all real numbers for which . So the Fourier transform represents a signal in terms of an infinite number of sine waves with infinitely small strengths (unless contains an impulse!). Through the magic of calculus, these all add up to a finite number for each .

### Examples of the Fourier Transform

First let’s look at a simple well-behaved signal: a rectangle with height and width :

Let’s just apply the definition of the transform and evaluate the integral. We have the mathematical definition of the signal

and so the Fourier transform is defined by

Using the double arrow notation,

To obtain the Fourier transform of a constant, note that

and that the function for is just the constant . However, we can also approach this transform in a different way. Suppose we attempt to find the Fourier transform of an impulse directly

so that the Fourier transform of an impulse is a constant. If we look at the corresponding inverse transform,

must hold. This implies that

We have the two Fourier transform pairs

and

The transform of a complex sine wave follows from the analysis for a constant we just looked at:

We interpret this to mean that the ‘frequency content’ of a complex-valued sine wave is concentrated at a single frequency.

There are many mathematical properties of the Fourier transform that become useful when you do a lot of signal-processing analysis work. A particularly useful one in the context of radio-frequency communication signal modeling and analysis is the frequency-shifting property. That is, given the pair , what is the signal that corresponds to the transform ? We could solve this using the inverse transform, but let’s guess the answer is and work through the forward transform.

### Discrete-Time Counterparts

Suppose we have a discrete-time signal defined for integers . Then the discrete-time Fourier series is defined by the Fourier coefficients ,

and the representation of is given by

The representation is valid for all if is periodic with period . Note that most of the are redundant because , so that we can restrict our attention to the coefficients with indices .

Let’s define a discrete-time/continuous-frequency transformation by

where . You can verify that

In signal-processing practice, we are most often interested in the transform of a finite number of samples . From our development so far, we can consider a set of equally spaced frequencies, or we can consider all frequencies. For digital signal processing applications, it is natural to focus on the former because they can be easily stored in computer memory. The sampled discrete-time Fourier transform, which is the discrete-time Fourier series, is therefore commonly called the *discrete Fourier transform* (DFT):

and

This transform is most efficiently computed using an algorithm called the fast Fourier transform (FFT). From MATLAB’s help for fft.m, we see that it is identical to our definition:

### Significance of the Fourier Transform in CSP

Although the Fourier transform for most mathematical models of communication signals does not exist (the DFT does though) , the transform plays a key role in the relationships between the temporal and spectral parameters. Recall our ‘golden diamond’ figure that relates all of the second-order and higher-order temporal and spectral parameters for stationary and cyclostationary signals:

We see here both Fourier series (green arrows) and Fourier transform (light purple arrows) relationships. The cyclic autocorrelation function is a Fourier coefficient of the time-varying autocorrelation function; the cyclic polyspectrum is the multi-dimensional Fourier transform of the cyclic temporal cumulant; the power spectrum and the conventional autocorrelation are a Fourier transform pair.

The discrete Fourier transform, which takes numbers in the time domain (typically) and produces numbers in the frequency domain, is the way we implement the various CSP algorithms that may be derived in continuous time and frequency, so both the continuous-time Fourier transform and the discrete-time Fourier transform are keys to CSP, the former for analysis and the latter for practice.

We’ve now developed sufficient tools and signal characterizations to begin our study of linear systems.

Previous SPTK Post: The Fourier Series Next SPTK Post: Linear Systems