Summary: The Fast Fourier transform (FFT) is an efficient algorithm for computing the Discrete Fourier Transform. The FFT is a block-based algorithm.
Note: Your browser may not currently support MathML. See our browser support page for additional details. You can always view the correct math in the PDF version.
The Fast Fourier Transform (FFT) can be used to analyze the spectral content of a signal. Recall that the FFT is an efficient algorithm for computing the Discrete Fourier Transform (DFT), a frequency-sampled version of the DTFT.
Because the FFT is a block-based algorithm, its computation is performed at the block I/O rate, in contrast to other exercises in which processing occurred on a sample-by-sample basis.