Next: Convolution
Up: Sampling
Previous: The Fourier transform
  Contents
Fourier transforms of base functions
As already mentioned, Fourier transform computations often are easily
facilitated by using known Fourier transforms of basic
functions. Here, FTs of some of the functions defined in
Sec. 3.1 are given, which were said to be
particularly useful.
First, we are interested in the Fourier transform of the impulse
function. This is easily computed by
 |
(3.19) |
which also follows directly from Eq. 3.5 with
t=0. This means that the FT of
is the unity function, i.e.,
 |
(3.20) |
This means that the Fourier transform of an impulse signal is a flat
spectrum, i.e., it has equal energy at all frequencies and, inversely,
a flat signal only has energy at
.
If we shift the impulse
to some position t, we also get as a direct consequence of
Eq. 3.5
 |
(3.21) |
Second, we want to compute the FT of the comb function and, quite
interestingly, it turns out that this is another comb function but
with reciprocal spacing:
 |
(3.22) |
Next: Convolution
Up: Sampling
Previous: The Fourier transform
  Contents
1999-12-29