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:

    Who liveth by the ragged pine
    Foundeth a heroic line;
    Who liveth in the palace hall
    Waneth fast and spendeth all.
    Ralph Waldo Emerson (1803–1882)