ConceptMathematics
Fast Fourier transform (FFT) computational complexity
The FFT algorithm reduces the computational cost of an n-point Fourier transform from operations to operations by recursively factoring the Fourier matrix.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.