| Applying science to business management |
  
fft
Format: fft( list )
Arguments: [num] list Input data points in the
time domain
Returns: [num] Fast Fourier Transform of the data in list
Description: Fft transforms time-series data in list
into its spectral components using a Fast Fourier Transform
algorithm. The result is a list of complex numbers representing
the magnitude and phase of each spectral component.
For best performance, the number of data points in list
should be a power of 2 (e.g., 2, 4, 8, 16, 32, 64, 128, 256, etc.
). If the number of data points is anything other than a power of
two, fft uses a combination of Fast Fourier Transform and
Discrete Fourier Transform algorithms.
Examples: fft(Data) = Returns
the Fourier transform of the information in Data
abs[fft(Data)] = Power
spectrum for the information in Data
invfft(fft(Data)) = Data
See Also: invfft
|