a technique for performing these mathematical operations very quickly with a computer

A computationally efficient mathematical technique that converts digital information from the time domain to the frequency domain for rapid spectral analysis. FFTs generally use a "time weighting" function to compensate for data records with a non-integer number of samples; some popular weighting functions are Hanning Window and 4-term Blackman-Harris.

A computationally very efficient way to calculate a Fourier Transform. See: Fourier Transform

(FFT) shows the frequency components of a waveform (vertical axis) as a function of time (horizontal axis). The result is often referred to as a power spectrum. This approach can also be use in calculating F0 (see FFT-Comb).

A Fourier Transform is the mathematical operation that takes measurements made with a radio interferometer and transforms them into an image of the radio sky. The Fast Fourier Transform is technique used by computer programs that allows the Fourier Transform to be computed very quickly.

An optimised version of the DFT.

A computer (or microprocessor) procedure for calculating discrete frequency components from sampled time data. A special case of the Discrete Fourier Transform, DFT, where the number of samples is constrained to a power of 2 for speed.

(FFT) - an algorithm which greatly speeds up the computation of Fourier transforms.

The FFT is an algorithm, or digital calculation routine, that efficiently calculates the discrete Fourier transform from the sampled time waveform. In other words it converts, or "transforms" a signal from the time domain into the frequency domain.

An algorithm that permits real-time signal spectrum analysis.

(Abbreviated FFT.) An algorithm to compute rapidly the digital form of the discrete Fourier transform. The procedure requires that the length of the data series undergoing transformation be an integral power of two, which is often achieved by truncating the series or extending it with zeros. More flexible mixed-radix algorithms have been developed that allow data series of any length. They gain efficiency as the prime factors of the length become small, and they are equivalent to the FFT when the data series length is a power of two.

A fast Fourier transform (FFT) is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. FFTs are of great importance to a wide variety of applications, from digital signal processing to solving partial differential equations to algorithms for quickly multiplying large integers. This article describes the algorithms, of which there are many; see discrete Fourier transform for properties and applications of the transform.