Introduction

The Fast Fourier Transform (FFT) is an efficient O(NlogN) algorithm for calculating DFTs The FFT exploits symmetries in the WW matrix to take a "divide and conquer" approach. We will first discuss deriving the actual FFT algorithm, some of its implications for the DFT, and a speed comparison to drive home the importance of this powerful algorithm.

Deriving the FFT

To derive the FFT, we assume that the signal's duration is a power of two: N=2l N 2 l . Consider what happens to the even-numbered and odd-numbered elements of the sequence in the DFT calculation.

Each term in square brackets has the form of a N2 N 2 -length DFT. The first one is a DFT of the even-numbered elements, and the second of the odd-numbered elements. The first DFT is combined with the second multiplied by the complex exponential e−(i⁢2⁢π⁢k)N 2 k N . The half-length transforms are each evaluated at frequency indices k∈0…N−1 k 0 … N 1 . Normally, the number of frequency indices in a DFT calculation range between zero and the transform length minus one. The computational advantage of the FFT comes from recognizing the periodic nature of the discrete Fourier transform. The FFT simply reuses the computations made in the half-length transforms and combines them through additions and the multiplication by e−(i⁢2⁢π⁢k)N 2 k N , which is not periodic over N2 N 2 , to rewrite the length-N DFT. Figure 1 illustrates this decomposition. As it stands, we now compute two length- N2 N 2 transforms (complexity 2⁢O⁢N24 2 O N 2 4 ), multiply one of them by the complex exponential (complexity O⁢N O N ), and add the results (complexity O⁢N O N ). At this point, the total complexity is still dominated by the half-length DFT calculations, but the proportionality coefficient has been reduced.

Now for the fun. Because N=2l N 2 l , each of the half-length transforms can be reduced to two quarter-length transforms, each of these to two eighth-length ones, etc. This decomposition continues until we are left with length-2 transforms. This transform is quite simple, involving only additions. Thus, the first stage of the FFT has N2 N 2 length-2 transforms (see the bottom part of Figure 1). Pairs of these transforms are combined by adding one to the other multiplied by a complex exponential. Each pair requires 4 additions and 4 multiplications, giving a total number of computations equaling 8⁢N4=N2 8 N 4 N 2 . This number of computations does not change from stage to stage. Because the number of stages, the number of times the length can be divided by two, equals log2N 2 N , the complexity of the FFT is O⁢N⁢logN O N N .

Figure 1: The initial decomposition of a length-8 DFT into the terms using even- and odd-indexed inputs marks the first phase of developing the FFT algorithm. When these half-length transforms are successively decomposed, we are left with the diagram shown in the bottom panel that depicts the length-8 FFT computation.

Length-8 DFT decomposition
(a) (b)

Doing an example will make computational savings more obvious. Let's look at the details of a length-8 DFT. As shown on Figure 1, we first decompose the DFT into two length-4 DFTs, with the outputs added and subtracted together in pairs. Considering Figure 1 as the frequency index goes from 0 through 7, we recycle values from the length-4 DFTs into the final calculation because of the periodicity of the DFT output. Examining how pairs of outputs are collected together, we create the basic computational element known as a butterfly (Figure 2).

Figure 2: The basic computational element of the fast Fourier transform is the butterfly. It takes two complex numbers, represented by a and b, and forms the quantities shown. Each butterfly requires one complex multiplication and two complex additions.

Butterfly

By considering together the computations involving common output frequencies from the two half-length DFTs, we see that the two complex multiplies are related to each other, and we can reduce our computational work even further. By further decomposing the length-4 DFTs into two length-2 DFTs and combining their outputs, we arrive at the diagram summarizing the length-8 fast Fourier transform (Figure 1). Although most of the complex multiplies are quite simple (multiplying by e−(i⁢π) means negating real and imaginary parts), let's count those for purposes of evaluating the complexity as full complex multiplies. We have N2=4 N 2 4 complex multiplies and 2⁢N=16 2 N 16 additions for each stage and log2N=3 2 N 3 stages, making the number of basic computations 3⁢N2⁢log2N 3 N 2 2 N as predicted.

Speed Comparison

How much better is O(NlogN) than O( N2 N 2 )?

Figure 3: This figure shows how much slower the computation time of an O(NlogN) process grows.

Say you have a 1 MFLOP machine (a million "floating point" operations per second). Let N=1⁢million=106 N 1 million 10 6 .

An O( N2 N 2 ) algorithm takes 10121012 flors → 106 10 6 seconds ≃ 11.5 days.

An O( N⁢logN N N ) algorithm takes 6×106 6 10 6 Flors → 6 seconds.

Conclusion

Other "fast" algorithms have been discovered, most of which make use of how many common factors the transform length N has. In number theory, the number of prime factors a given integer has measures how composite it is. The numbers 16 and 81 are highly composite (equaling 24 2 4 and 34 3 4 respectively), the number 18 is less so ( 21⁢32 2 1 3 2 ), and 17 not at all (it's prime). In over thirty years of Fourier transform algorithm development, the original Cooley-Tukey algorithm is far and away the most frequently used. It is so computationally efficient that power-of-two transform lengths are frequently used regardless of what the actual length of the data. It is even well established that the FFT, alongside the digital computer, were almost completely responsible for the "explosion" of DSP in the 60's.