Fast Discrete Fourier Transform (FFT)

Not a new transform.  Only an alternative algorithm to compute the DFT.  Time relationship:

FFT performs computation "in place" -> requires less temporary storage.

FFT routines usually require data sequence lengths that are a power of 2 (64, 256, 512, 1024, etc...)

- need to apply "Zero padding"

Back to Contents Menu