Glossary definition of 'Fast Fourier Transform'

(FFT) A Discrete Fourier Transform (DFT) calculates the spectrum of a sampled signal, i.e. it transforms the time domain signal (e.g. the dScope`s sample buffer, as shown by the Scope Trace) into the frequency domain. A Fast Fourier Transform (FFT) allows a DFT to be calculated more efficiently, i.e. faster, assuming that the length of the data set (sample buffer) is 2n samples.