DFT

Purpose:

Directly calculates the discrete Fourier Transform of any table or series expression in Real/Imaginary form.

Syntax:

DFT(series)

Returns:

A series or table.

Example:

W1: gsin(256, 1/256, 1.0)

W2: dft(W1)

W3: fft(W1)

The DFT (Discrete Fourier Transform) and FFT (Fast Fourier Transform) functions produce the same results. However, the FFT will compute the result much faster than the DFT by taking advantage of symmetries in the transform algorithm.

Remarks:

The DFT returns the same result as an FFT. Although the DFT is a more straightforward method than the FFT for calculating the Discrete Fourier Transform, it is also a much slower algorithm.

See Also:

FFT

IDFT

SPECTRUM

References:

Oppenheim and Schafer.

Digital Signal Processing

Prentice Hall, 1975

Digital Signal Processing Committee

Programs for Digital Signal Processing

I.E.E.E. Press, 1979