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:
“And here the precious dust is layd;
Whose purely temper’d Clay was made
So fine, that it the guest betray’d.
Else the soule grew so fast within,
It broke the outward shell of sinne,
And so was hatch’d a Cherubin.”
—Thomas Carew (1589–1639)