Discrete Fourier Transform (general) - Fast Algorithms

Fast Algorithms

For the implementation of a "fast" algorithm (similar to how FFT computes the DFT), it is often desirable that the transform length is also highly composite, e.g. a power of two. However, there are specialized fast Fourier transform algorithms for finite fields, such as Wang and Zhu's algorithm, which are efficient regardless of whether the transform length factors.

Read more about this topic:  Discrete Fourier Transform (general)

Famous quotes containing the word fast:

    We hear eagerly every thought and word quoted from an intellectual man. But in his presence our own mind is roused to activity, and we forget very fast what he says.
    Ralph Waldo Emerson (1803–1882)