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:

    Today’s pressures on middle-class children to grow up fast begin in early childhood. Chief among them is the pressure for early intellectual attainment, deriving from a changed perception of precocity. Several decades ago precocity was looked upon with great suspicion. The child prodigy, it was thought, turned out to be a neurotic adult; thus the phrase “early ripe, early rot!”
    David Elkind (20th century)