• Summing together only three discrete frequencies can produce a much more erratic composite. The Fourier transform provides a way to decompose signals into their constituent frequencies.

Full Screen

# Explained: The Discrete Fourier Transform

The theories of an early-19th-century French mathematician have emerged from obscurity to become part of the basic language of engineering.

Science and technology journalists pride themselves on the ability to explain complicated ideas in accessible ways, but there are some technical principles that we encounter so often in our reporting that paraphrasing them or writing around them begins to feel like missing a big part of the story. So in a new series of articles called "Explained," MIT News Office staff will explain some of the core ideas in the areas they cover, as reference points for future reporting on MIT research.

In 1811, Joseph Fourier, the 43-year-old prefect of the French district of Isère, entered a competition in heat research sponsored by the French Academy of Sciences. The paper he submitted described a novel analytical technique that we today call the Fourier transform, and it won the competition; but the prize jury declined to publish it, criticizing the sloppiness of Fourier’s reasoning. According to Jean-Pierre Kahane, a French mathematician and current member of the academy, as late as the early 1970s, Fourier’s name still didn’t turn up in the major French encyclopedia the Encyclopædia Universalis.

Now, however, his name is everywhere. The Fourier transform is a way to decompose a signal into its constituent frequencies, and versions of it are used to generate and filter cell-phone and Wi-Fi transmissions, to compress audio, image, and video files so that they take up less bandwidth, and to solve differential equations, among other things. It’s so ubiquitous that “you don’t really study the Fourier transform for what it is,” says Laurent Demanet, an assistant professor of applied mathematics at MIT. “You take a class in signal processing, and there it is. You don’t have any choice.”

The Fourier transform comes in three varieties: the plain old Fourier transform, the Fourier series, and the discrete Fourier transform. But it’s the discrete Fourier transform, or DFT, that accounts for the Fourier revival. In 1965, the computer scientists James Cooley and John Tukey described an algorithm called the fast Fourier transform, which made it much easier to calculate DFTs on a computer. All of a sudden, the DFT became a practical way to process digital signals.

To get a sense of what the DFT does, consider an MP3 player plugged into a loudspeaker. The MP3 player sends the speaker audio information as fluctuations in the voltage of an electrical signal. Those fluctuations cause the speaker drum to vibrate, which in turn causes air particles to move, producing sound.

An audio signal’s fluctuations over time can be depicted as a graph: the x-axis is time, and the y-axis is the voltage of the electrical signal, or perhaps the movement of the speaker drum or air particles. Either way, the signal ends up looking like an erratic wavelike squiggle. But when you listen to the sound produced from that squiggle, you can clearly distinguish all the instruments in a symphony orchestra, playing discrete notes at the same time.

That’s because the erratic squiggle is, effectively, the sum of a number of much more regular squiggles, which represent different frequencies of sound. “Frequency” just means the rate at which air molecules go back and forth, or a voltage fluctuates, and it can be represented as the rate at which a regular squiggle goes up and down. When you add two frequencies together, the resulting squiggle goes up where both the component frequencies go up, goes down where they both go down, and does something in between where they’re going in different directions.

The DFT does mathematically what the human ear does physically: decompose a signal into its component frequencies. Unlike the analog signal from, say, a record player, the digital signal from an MP3 player is just a series of numbers, each representing a point on a squiggle. Collect enough such points, and you produce a reasonable facsimile of a continuous signal: CD-quality digital audio recording, for instance, collects 44,100 samples a second. If you extract some number of consecutive values from a digital signal — 8, or 128, or 1,000 — the DFT represents them as the weighted sum of an equivalent number of frequencies. (“Weighted” just means that some of the frequencies count more than others toward the total.)

The application of the DFT to wireless technologies is fairly straightforward: the ability to break a signal into its constituent frequencies lets cell-phone towers, for instance, disentangle transmissions from different users, allowing more of them to share the air.

The application to data compression is less intuitive. But if you extract an eight-by-eight block of pixels from an image, each row or column is simply a sequence of eight numbers — like a digital signal with eight samples. The whole block can thus be represented as the weighted sum of 64 frequencies. If there’s little variation in color across the block, the weights of most of those frequencies will be zero or near zero. Throwing out the frequencies with low weights allows the block to be represented with fewer bits but little loss of fidelity.

Demanet points out that the DFT has plenty of other applications, in areas like spectroscopy, magnetic resonance imaging, and quantum computing. But ultimately, he says, “It’s hard to explain what sort of impact Fourier’s had,” because the Fourier transform is such a fundamental concept that by now, “it’s part of the language.”

I really enjoyed that. Thanks,

Raiz

So that's what a Fourier transform does :)

Can we get one on wavelet steering?

Thank you for your interesting article.

This article should be read by many people to be known(especially by students) how mathematics is being used in real society.

Here in Japan, children aren't taught how what they learn is used after their graduation or in real society.

They learn how to pass the exam of university or highschool.

Fourier transform is not the type children learn, but it is a good example or "real mathematics".

Nice & clear, thanks

As an electrical engineering professor, I use Fourier transforms all the time, but have rarely seen it so lucidly described for a general audience --- nicely done!

It was nice to learn that a Fourier transform decomposes a signal into its constituent frequencies. But, what I would like to know is how it is does the decomposition. Any possibility that could be explained to a lay person?

Good article: I didn't knew about the DFT were so useful in sci and tech. I remember when I was in school getting an Applied Mathematics course. I got facinated for the simplicity of the DFT. With just a period of a function you can get an entire series of continuous functions (sines and cosines). In contrast, the real power of the method is to describe a like-erratic wave function as an intrinsicly continuous and periodic.

When talking about a DFT is always known f(x) (our signal), in at least one single interval, in the next period f is gonna have the same shape because its a periodic function (signal), then we can write f(x) = f(x + T) where T is the period of the sample. We just need the function in one single interval.

Then you apply other calculations to get the terms of the series (coeficients and frecuencies), that's all. Now, how do they make those calculations in real time? I have no clue.

I plan to read it! Good~

Beautiful!!

An exquisite explanation to Fourier Transform.

Thx to the article.

To put it frankly, chirlren in China has the same problem about leanning, what they are trained is to pass the exam, we should let them know the real way to study!

I plan to read it! Good~ livescore

The DFT, and its baby-brother DCT (Discrete _Cosine_ Transform), is worthless for video compression: What happens on the right is almost independent of what happens on the left and looks like a bathroom window, (Try the Haar- or H-Transform instead)...

But it is, good, for ultra-high-tech signal analysis like 8-ary-MFSK... We did a late-1970's project at Linkabit with Lincoln Labs, MIT, which processed the signal in Complex-space (Redundancy of hardware too)... but since we could only easily decimate the I-Q quadrants by rotation, we still had to straight-multiply a minimum 2 frequencies... so we called it, the Half-Fast Fourier Transform....

Fourier Transform is so interesting and useful. May it do more contributions to the growth of technology.

Wow - what a great article. I finally understand this and it's applications. Thank you.

It's luckyfor me to understand this. Thank you!

I have been trying to understand that what is DFT actually in practical life. Thanks to you guys,

Back to the top