transforms
The Fast Fourier Transform: divide-and-conquer and $O(N\log N)$
taught
Taught in
-
The cost of the naive DFT
Fourier Analysis
-
Divide and conquer: splitting even and odd indices
Fourier Analysis
-
The Cooley–Tukey recursion, derived
Fourier Analysis
-
The butterfly operation
Fourier Analysis
-
O(N²) vs. O(N log N), made concrete
Fourier Analysis
-
Where the FFT matters in practice
Fourier Analysis
-
What a dedicated digital signal processing course adds
Fourier Analysis
Requires
- dft-definition-and-matrix-form required
Required by
Nothing in the catalog needs this yet.
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.