7.00.02.01 - Time Series, Path, and Attribution Analysis - Aster Analytics

• FFT. The FFT function uses a Fast Fourier Transform (FFT) algorithm to compute the discrete Fourier Transform (DFT) of each signal in one or more input table columns. A signal can be either real or complex, and can have one, two, or three dimensions.
• IFFT. The IFFT function uses an inverse Fast Fourier Transform (IFFT) algorithm (also called a Fourier synthesis algorithm) to reverse the Fast Fourier Transform (FFT) performed by the FFT function.