7.00.02 - Fast Fourier Transform Functions - Aster Analytics

Teradata Aster® Analytics Foundation User GuideUpdate 2

Product
Aster Analytics
Release Number
7.00.02
Published
September 2017
Language
English (United States)
Last Update
2018-04-17
dita:mapPath
uce1497542673292.ditamap
dita:ditavalPath
AA-notempfilter_pdf_output.ditaval
dita:id
zuk1466006200888
  • FFT uses a Fast Fourier Transform (FFT) algorithm to compute the discrete Fourier Transform (DFT) of each signal in one or more input table columns.
  • IFFT uses an inverse Fast Fourier Transform (IFFT) algorithm (also called a Fourier synthesis algorithm) to reverse the Fast Fourier Transform performed by the FFT function; that is, the IFFT function takes a frequency domain representation and combines the contributions of all the different frequencies to recover the original signal.