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:
“Although knaves win in every political struggle, although society seems to be delivered over from the hands of one set of criminals into the hands of another set of criminals, as fast as the government is changed, and the march of civilization is a train of felonies, yet, general ends are somehow answered.”
—Ralph Waldo Emerson (1803–1882)