Rader's FFT algorithm

Rader's algorithm (1968), named for Charles M. Rader of MIT Lincoln Laboratory, is a fast Fourier transform (FFT) algorithm that computes the discrete Fourier transform (DFT) of prime sizes by re-expressing the DFT as a cyclic convolution (the other algorithm for FFTs of prime sizes, Bluestein's algorithm, also works by rewriting the DFT as a convolution).

Since Rader's algorithm only depends upon the periodicity of the DFT kernel, it is directly applicable to any other transform (of prime order) with a similar property, such as a number-theoretic transform or the discrete Hartley transform.

The algorithm can be modified to gain a factor of two savings for the case of DFTs of real data, using a slightly modified re-indexing/permutation to obtain two half-size cyclic convolutions of real data; an alternative adaptation for DFTs of real data uses the discrete Hartley transform.Matteo Frigo and Steven G. Johnson,
The Design and Implementation of FFTW3
" ''Proceedings of the IEEE'' 93 (2), 216–231 (2005).

Winograd extended Rader's algorithm to include prime-power DFT sizes $p^m$, and today Rader's algorithm is sometimes described as a special case of Winograd's FFT algorithm, also called the ''multiplicative Fourier transform algorithm'' (Tolimieri et al., 1997), which applies to an even larger class of sizes. However, for composite sizes such as prime powers, the Cooley–Tukey FFT algorithm is much simpler and more practical to implement, so Rader's algorithm is typically only used for large-prime base cases of Cooley–Tukey's recursive decomposition of the DFT.

Algorithm

Begin with the definition of the discrete Fourier transform:

:$X_k = \sum_^ x_n e^ \qquad k = 0,\dots,N-1.$

If ''N'' is a prime number, then the set of non-zero indices $n \in \$ forms a group under multiplication modulo ''N''. One consequence of the number theory of such groups is that there exists a generator of the group (sometimes called a primitive root, which can be found by exhaustive search or slightly better algorithmsDonald E. Knuth, ''The Art of Computer Programming, vol. 2: Seminumerical Algorithms'', 3rd edition, section 4.5.4, p. 391 (Addison–Wesley, 1998).). This generator is an integer ''g'' such that $n = g^q \pmod N$ for any non-zero index ''n'' and for a unique $q \in \$ (forming a bijection from ''q'' to non-zero ''n''). Similarly, $k = g^ \pmod N$ for any non-zero index ''k'' and for a unique $p \in \$, where the negative exponent denotes the multiplicative inverse of $g^p \mod N$. That means that we can rewrite the DFT using these new indices ''p'' and ''q'' as:

:$X_0 = \sum_^ x_n,$

:$X_ = x_0 + \sum_^ x_ e^ \qquad p = 0,\dots,N-2.$

(Recall that ''x''_''n'' and ''X''_''k'' are implicitly periodic in ''N'', and also that $e^=1$ (Euler's identity). Thus, all indices and exponents are taken modulo ''N'' as required by the group arithmetic.)

The final summation, above, is precisely a cyclic convolution of the two sequences ''a''_''q'' and ''b''_''q'' (of length ''N''–1, because $q \in \$) defined by:

:$a_q = x_$
:$b_q = e^.$

Evaluating the convolution

Since ''N''–1 is composite, this convolution can be performed directly via the convolution theorem and more conventional FFT algorithms. However, that may not be efficient if ''N''–1 itself has large prime factors, requiring recursive use of Rader's algorithm. Instead, one can compute a length-(''N''–1) cyclic convolution exactly by zero-padding it to a length of at least 2(''N''–1)–1, say to a power of two, which can then be evaluated in O(''N'' log ''N'') time without the recursive application of Rader's algorithm.

This algorithm, then, requires O(''N'') additions plus O(''N'' log ''N'') time for the convolution. In practice, the O(''N'') additions can often be performed by absorbing the additions into the convolution: if the convolution is performed by a pair of FFTs, then the sum of ''x''_''n'' is given by the DC (0th) output of the FFT of ''a''_''q'' plus ''x''₀, and ''x''₀ can be added to all the outputs by adding it to the DC term of the convolution prior to the inverse FFT. Still, this algorithm requires intrinsically more operations than FFTs of nearby composite sizes, and typically takes 3–10 times as long in practice.

If Rader's algorithm is performed by using FFTs of size ''N''–1 to compute the convolution, rather than by zero padding as mentioned above, the efficiency depends strongly upon ''N'' and the number of times that Rader's algorithm must be applied recursively. The worst case would be if ''N''–1 were 2''N''₂ where ''N''₂ is prime, with ''N''₂–1 = 2''N''₃ where ''N''₃ is prime, and so on. In such cases, supposing that the chain of primes extended all the way down to some bounded value, the recursive application of Rader's algorithm would actually require O(''N''²) time{{Dubious, Time complexity without zero-padding, date=January 2021. Such ''N''_j are called Sophie Germain primes, and such a sequence of them is called a Cunningham chain of the first kind. The lengths of Cunningham chains, however, are observed to grow more slowly than log₂(''N''), so Rader's algorithm applied in this way is probably not O(''N''²), though it is possibly worse than O(''N'' log ''N'') for the worst cases. Fortunately, a guarantee of O(''N'' log ''N'') complexity can be achieved by zero padding.

References

FFT algorithms