Fast Fourier Transform
The Cooley–Tukey algorithm splits an N-point DFT into interleaved even- and odd-index DFTs of size N/2 and reuses the symmetry of the roots of unity, cutting the cost from O(N²) to O(N log N) — the speedup that makes real-time spectral analysis and fast convolution practical.
This Concept is waiting for its first lesson!
The Cooley–Tukey algorithm splits an N-point DFT into interleaved even- and odd-index DFTs of size N/2 and reuses the symmetry of the roots of unity, cutting the cost from O(N²) to O(N log N) — the speedup that makes real-time spectral analysis and fast convolution practical.
Are you a teacher? Sign in to start contributing.
Sign In