9.5: Properties of the Fourier Transform
( \newcommand{\kernel}{\mathrm{null}\,}\)
We now return to the Fourier transform. Before actually computing the Fourier transform of some functions, we prove a few of the properties of the Fourier transform.
First we note that there are several forms that one may encounter for the Fourier transform. In applications functions can either be functions of time,
or
We explore a few basic properties of the Fourier transform and use them in examples in the next section.
- and
- Transform of a Derivative:
Here we compute the Fourier transform (9.3.5) of the derivative by inserting the derivative in the Fourier integral and using integration by parts.The limit will vanish if we assume that
. The last integral is recognized as the Fourier transform of , proving the given property. - Higher Order Derivatives:
The proof of this property follows from the last result, or doing several integration by parts. We will consider the case when . Noting that the second derivative is the derivative of and applying the last result, we haveThis result will be true if
The generalization to the transform of the
th derivative easily follows. - Multiplication by
This property can be shown by using the fact that and the ability to differentiate an integral with respect to a parameter.This result can be generalized to
as an exercise. - Here we have denoted the Fourier transform pairs using a double arrow as
. These are easily proven by inserting the desired forms into the definition of the Fourier transform (9.3.5), or inverse Fourier transform (9.3.6). The first shift property is shown by the following argument. We evaluate the Fourier transform.The second shift property
follows in a similar way. - Then, the Fourier transform of the convolution is the product of the Fourier transforms of the individual functions:
Fourier Transform Examples
In this section we will compute the Fourier transforms of several functions.
Find the Fourier transform of a Gaussian,
Solution
This function, shown in Figure

We begin by applying the definition of the Fourier transform,
The first step in computing this integral is to complete the square in the argument of the exponential. Our goal is to rewrite this integral so that a simple substitution will lead to a classic integral of the form
We now put this expression into the integral and make the substitutions
One would be tempted to absorb the

In this case we can deform this horizontal contour to a contour along the real axis since we will not cross any singularities of the integrand. So, we now safely write
The resulting integral is a classic integral and can be performed using a standard trick. Define
Then,
Note that we needed to change the integration variable so that we can write this product as a double integral:
This is an integral over the entire
The final result is gotten by taking the square root, yielding
We can now insert this result to give the Fourier transform of the Gaussian function:
Therefore, we have shown that the Fourier transform of a Gaussian is a Gaussian.
Note that we solved the
Find the Fourier transform of the Box, or Gate, Function,
Solution
This function is called the box function, or gate function. It is shown in Figure

The Fourier transform of the box function is relatively easy to compute. It is given by
We can rewrite this as
Here we introduced the sinc function
A plot of this function is shown in Figure

We will now consider special limiting values for the box function and its transform. This will lead us to the Uncertainty Principle for signals, connecting the relationship between the localization properties of a signal and its transform.
and fixed
In this case, as a gets large the box function approaches the constant function . At the same time, we see that the Fourier transform approaches a Dirac delta function. We had seen this function earlier when we first defined the Dirac delta function. Compare Figure with Figure 9.3.1. In fact, . [Recall the definition of in Equation (9.3.10).] So, in the limit we obtain . This limit implies fact that the Fourier transform of is . As the width of the box becomes wider, the Fourier transform becomes more localized. In fact, we have arrived at the important result that , and .
In this case the box narrows and becomes steeper while maintaining a constant area of one. This is the way we had found a representation of the Dirac delta function previously. The Fourier transform approaches a constant in this limit. As a approaches zero, the sinc function approaches one, leaving . Thus, the Fourier transform of the Dirac delta function is one. Namely, we haveIn this case we have that the more localized the function
is, the more spread out the Fourier transform, , is. We will summarize these notions in the next item by relating the widths of the function and its Fourier transform.- The Uncertainty Principle,
.
The widths of the box function and its Fourier transform are related as we have seen in the last two limiting cases. It is natural to define the width, of the box function asThe width of the Fourier transform is a little trickier. This function actually extends along the entire
-axis. However, as became more localized, the central peak in Figure became narrower. So, we define the width of this function, as the distance between the first zeros on either side of the main lobe as shown in Figure . This givesCombining these two relations, we find that
Thus, the more localized a signal, the less localized its transform and vice versa. This notion is referred to as the Uncertainty Principle. For general signals, one needs to define the effective widths more carefully, but the main idea holds:

We now turn to other examples of Fourier transforms.
Find the Fourier transform of
Solution
The Fourier transform of this function is
Next, we will compute the inverse Fourier transform of this result and recover the original function.
More formally, the uncertainty principle for signals is about the relation between duration and bandwidth, which are defined by
Find the inverse Fourier transform of
Solution
The inverse Fourier transform of this function is
This integral can be evaluated using contour integral methods. We evaluate the integral
using Jordan’s Lemma from Section 8.5.8. According to Jordan’s Lemma, we need to enclose the contour with a semicircle in the upper half plane for

The integrations along the semicircles will vanish and we will have
Note that without paying careful attention to Jordan’s Lemma one might not retrieve the function from the last example.
Find the inverse Fourier transform of
Solution
We would like to find the inverse Fourier transform of this function. Instead of carrying out any integration, we will make use of the properties of Fourier transforms. Since the transforms of sums are the sums of transforms, we can look at each term individually. Consider
Recalling from Example
we have from the shift property that
The second term can be transformed similarly. Therefore, we have
Find the Fourier transform of the finite wave train.
Solution
For the last example, we consider the finite wave train, which will reappear in the last chapter on signal analysis. In Figure
A straight forward computation gives