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:
“Few parents nowadays pay any regard to what their children say to them. The old-fashioned respect for the young is fast dying out.”
—Oscar Wilde (1854–1900)