MATLAB Mathematics - SERC - Index of

3
Fast Fourier Transform
(FFT)
Introduction (p. 3-2)
Magnitude and Phase of Transformed
Data (p. 3-7)
FFT Length Versus Speed (p. 3-9)
Function Summary (p. 3-10)
Introduces Fourier transform analysis with an example
about sunspot activity
Calculates magnitude and phase of transformed data
Discusses the dependence of execution time on length of the
transform
Summarizes the Fourier transform functions
The fast Fourier transform (FFT) is an efficient algorithm for computing the
discrete Fourier transform (DFT) of a sequence; it is not a separate transform.
It is particularly useful in areas such as signal and image processing, where its
uses range from filtering, convolution, and frequency analysis to power
spectrum estimation.