Technology1 min read

Notes on the discrete Fourier transform (DFT)

By · Published by Everything Blog

In short

Continuous methods like the Discrete-Time Fourier Transform yield continuous functions that cannot be fully evaluated on a computer. In contrast, this approach handles finite inputs as single periods of infinite signals, producing discrete frequency coefficients that act as equally spaced samples of the continuous transform. These coefficients permit precise reconstruction of the original signal and can be calculated computationally using Python and NumPy.

Key points

  • Signals of finite duration can be accurately reconstructed using a discrete set of freque…: Signals of finite duration can be accurately reconstructed using a discrete set of frequency coefficients.
  • The approach models finite inputs as repeating periods to overcome the computational limi…: The approach models finite inputs as repeating periods to overcome the computational limits of continuous transforms.
  • Standard computational tools like Python and NumPy can directly implement the transformat…: Standard computational tools like Python and NumPy can directly implement the transformation process on sample sets.

Sources checked by our analysis pipeline: 1

In the previous post on this topic, we’ve seen how the Discrete-Time Fourier Series (DTFS) and transform (DTFT) are used to analyze infinite-duration periodic and non-periodic discrete signals. Now, it’s time to turn to realistic digital signal processing where signals are not only discrete, but also finite in duration.

Analyzing signal samples

Suppose we have samples of a signal - it’s a list of numbers:

We want to analyze the frequencies present in this signal; in other words, to find the coefficients in a series of complex exponentials that reconstructs the signal. One option is to assume that is an infinite domain signal with zero values outside our samples, and then compute its DTFT:

However, this is a continuous function of frequency , so it’s difficult compute on an actual computer; we cannot evaluate and store it for all , so we have to choose which to compute it for. We'll soon see how this choice is made.

The Discrete Fourier Transform (DFT)

But there's an alternative way to look at the problem. We only have samples of the signal…

Technology