# Category:Fast fourier transform

From LiteratePrograms

A fast Fourier transform (FFT) is a fast, typically O(*n* log *n*) algorithm for computing the discrete fourier transform of a signal. The most common by far is the Cooley-Tukey FFT algorithm.

## Pages in category "Fast fourier transform"

This category contains only the following page.