Scribd
Upload
13 views2 pages

Algorithm Fast Fourier Transform

The Fast Fourier Transform (FFT) is an efficient algorithm for computing the discrete Fourier transform (DFT) of a sequence of N samples, developed by Cooley and Tukey in 1965. Utilizing a divide-and-conquer approach, the FFT reduces the time complexity to O(N log N), making it significantly faster than the naive DFT algorithm. The FFT is widely used in applications such as signal processing, audio and image compression, and scientific computing.

Uploaded by

tatianilima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
13 views2 pages

Algorithm Fast Fourier Transform

The Fast Fourier Transform (FFT) is an efficient algorithm for computing the discrete Fourier transform (DFT) of a sequence of N samples, developed by Cooley and Tukey in 1965. Utilizing a divide-and-conquer approach, the FFT reduces the time complexity to O(N log N), making it significantly faster than the naive DFT algorithm. The FFT is widely used in applications such as signal processing, audio and image compression, and scientific computing.

Uploaded by

tatianilima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

💿

Algorithm Fast Fourier


Transform
The Fast Fourier Transform (FFT) is an algorithm used to efficiently compute
the discrete Fourier transform (DFT) of a sequence of N samples, where N is a
power of 2. The DFT is a mathematical technique that decomposes a finite
signal into its individual frequency components.
The FFT algorithm was developed by James Cooley and John Tukey in 1965,
and it quickly became the standard method for computing the DFT due to its
speed and efficiency. The algorithm is based on the divide-and-conquer
approach, which involves breaking down a larger problem into smaller
subproblems.
The basic idea behind the FFT algorithm is to recursively divide the N-point
DFT into two N/2-point DFTs. This process is repeated until the DFT is reduced
to a single point, at which point the algorithm can work backward to
reconstruct the full DFT. The key insight that makes the FFT algorithm so
efficient is that many of the intermediate results of the recursion can be reused,
leading to a significant reduction in the number of operations required.
The FFT algorithm has a time complexity of O(N log N), which is much faster
than the O(N^2) complexity of the naive DFT algorithm. This makes the FFT
algorithm essential for many applications that require the efficient computation
of the DFT, such as signal processing, audio and image compression, and
scientific computing.

Mentioned by:
“After the data collection stage, the acquired data is transferred to Matlab for
further processing. The Matlab module generates attention-related EEG
features based on Fast Fourier Transform (FFT) based spectral analysis and
sample entropy measurements.” Chapter: Signal Processing module
Khong et al., 2014

Algorithm Fast Fourier Transform 1


Algorithm Fast Fourier Transform 2

You might also like