##### Actions

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

WFT algorithm

An algorithm exploiting multiplicative structure on the data indexing set to transform a Fourier transform computation into a cyclic convolution computation [a1], [a4], [a5]. Divide-and-conquer fast Fourier transform algorithms, such as the Cooley–Tukey fast Fourier transform algorithms [a6], depend on the existence of non-trivial divisors of the transform size, which determine subgroups of the additive group structure of the indexing set and split the global computation into local computations. This divide-and-conquer strategy does not apply to prime size Fourier transform computations.

C. Rader [a2] observed that a Fourier transform computation of prime size could be computed by a -point cyclic convolution. S. Winograd [a4] extended Rader's result to Fourier transform computations of prime power size and introduced cyclic convolution algorithms based on the polynomial version of the Chinese remainder theorem to compute the resulting cyclic convolutions (cf. Winograd small convolution algorithm). The overall strategy is usually called the Winograd fast Fourier transform algorithm, or Winograd FFT algorithm. Rader computed the -point cyclic convolution by calling on the convolution theorem to turn the -point convolution into several -point Fourier transform computations.