Fourier Analysis · Calculus
Discrete Fourier Transform and FFT
The FFT reduces DFT computation from O(N²) to O(N log N) using divide-and-conquer. It is one of the most important algorithms in computational science.
WHAT STUDENTS WILL LEARN
✓Define the DFT and compute from definition
✓Interpret as a change of basis in ℂ^N
✓Derive the FFT and its O(N log N) complexity
✓Apply to convolution and signal analysis
COURSE OUTLINE · CLICK A PART FOR RESOURCES