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:
“I don’t go that fast in practice, because I need the excitement of the race, the adrenalin. The others might train more and be in better shape, but when I’m racing, I put winning before everything else. I don’t stop until the world gets gray and fuzzy around the edges.”
—Candi Clark (b. c. 1950)