Sign inSign in
ConceptMathematics

Fast Fourier transform (FFT) computational complexity

The FFT algorithm reduces the computational cost of an n-point Fourier transform from n2n^2 operations to 12nlog⁡2n\frac{1}{2} n \log_2 n operations by recursively factoring the Fourier matrix.
Watch it explained

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.

Fourier matrix1Matrix factorization1Recursion1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    Lecture1

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.