Digital Signal Processing
Fifth Edition
Chapter 8
Efficient Computation
of the DFT: Fast Fourier
Transform Algorithms
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.1 Two dimensional data array for storing the sequence x(n),
0 ≤ n ≤ N − 1.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.2 Two arrangements for the data arrays.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.3 Computation of N = 15-point DFT by means of 3-point and
5-point DFTs.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.4 First step in the decimation-in-time algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Table 8.1 Comparison of Computational Complexity for the Direct
Computation of the DFT Versus the FFT Algorithm
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.5 Three stages in the computation of an N = 8-point DFT.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.6 Eight-point decimation-in-time FFT algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.7 Basic butterfly computation in the decimation-in-time FFT
algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.8 Shuffling of the data and bit reversal.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.9 First stage of the decimation-in-frequency FFT algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.10 Basic butterfly computation in the decimation-in-frequency
FFT algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.11 N = 8-point decimation-in-frequency FFT algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.12 Basic butterfly computation in a radix-4 FFT algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.13 Sixteen-point radix-4 decimation-in-time algorithm with input in
normal order and output in digit-reversed order. The integer multipliers shown
on the graph represent the exponents on W16.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.14 Sixteen-point, radix-4 decimation-in-frequency algorithm with
input in normal order and output in digit-reversed order.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.15 Length 32 split-radix FFT algorithms from paper by Duhamel
(1986); reprinted with permission from the IEEE.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.1.16 Butterfly for SRFFT algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Table 8.2 Number of Nontrivial Real Multiplications and Additions to Compute
an N-point Complex DFT
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Table 8.3 Computational Complexity
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.3.1 Direct form II realization of two-pole resonator for computing the
DFT.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.3.2 Some examples of contours on which we may evaluate the
z-transform.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.3.3 Block diagram illustrating the implementation of the chirp-z
transform for computing the DFT (magnitude only).
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.4.1 Decimation-in-time FFT algorithm.
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Figure 8.4.2 Butterflies that affect the computation of X(3).
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
Copyright
Copyright © 2022 Pearson Education, Inc. All Rights Reserved
