Fast F ourier Transform ( FFT )
Emma J. McCoy · Wiley StatsRef: Statistics Reference Online · 2014
Abstract Data can be described either in the “time domain” or in the “frequency domain”. The frequency domain representations present details about the same signal in a different, potentially more illuminating way. The fast Fourier transform (FFT) provides a fast computational algorithm to obtain the coefficients of the discrete‐frequency representation.