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 in the next instant, immediately behind them, Victor saw his former wife.
At once he lowered his gaze, automatically tapping his cigarette to dislodge the ash that had not yet had time to form. From somewhere low down his heart rose like a fist to deliver an uppercut, drew back, struck again, then went into a fast disorderly throb, contradicting the music and drowning it.”
—Vladimir Nabokov (1899–1977)