prime-factor FFT algorithm

The prime-factor algorithm (PFA), also called the Good–Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re-expresses the discrete Fourier transform (DFT) of a size ''N'' = ''N''₁''N''₂ as a two-dimensional ''N''₁×''N''₂ DFT, but ''only'' for the case where ''N''₁ and ''N''₂ are relatively prime. These smaller transforms of size ''N''₁ and ''N''₂ can then be evaluated by applying PFA recursively or by using some other FFT algorithm.

PFA should not be confused with the ''mixed-radix'' generalization of the popular Cooley–Tukey algorithm, which also subdivides a DFT of size ''N'' = ''N''₁''N''₂ into smaller transforms of size ''N''₁ and ''N''₂. The latter algorithm can use ''any'' factors (not necessarily relatively prime), but it has the disadvantage that it also requires extra multiplications by roots of unity called twiddle factors, in addition to the smaller transforms. On the other hand, PFA has the disadvantages that it only works for relatively prime factors (e.g. it is useless for power-of-two sizes) and that it requires more complicated re-indexing of the data based on the additive group isomorphisms. Note, however, that PFA can be combined with mixed-radix Cooley–Tukey, with the former factorizing ''N'' into relatively prime components and the latter handling repeated factors.

PFA is also closely related to the nested Winograd FFT algorithm, where the latter performs the decomposed ''N''₁ by ''N''₂ transform via more sophisticated two-dimensional convolution techniques. Some older papers therefore also call Winograd's algorithm a PFA FFT.

(Although the PFA is distinct from the Cooley–Tukey algorithm, Good's 1958 work on the PFA was cited as inspiration by Cooley and Tukey in their 1965 paper, and there was initially some confusion about whether the two algorithms were different. In fact, it was the only prior FFT work cited by them, as they were not then aware of the earlier research by Gauss and others.)

Algorithm

Let $a(x)$ a polynomial and $\omega_n$ a principal $n$th root of unity. We define the DFT of $a(x)$ as the $n$-tuple $(\hat_j) = (a(\omega_n^j))$.
In other words,
:$\hat_j = \sum_^ a_i \omega_n^$ for all $j = 0, 1, \dots, n - 1$.
For simplicity, we denote the transformation as $\text_$.

The PFA relies on a coprime factorization of $n = \prod_^ n_d$ and turns $\text_$ into $\bigotimes_d \text_$ for some choices of $\omega_$'s where $\bigotimes$ is the tensor product.

Mapping Based on CRT

For a coprime factorization $n = \prod_^ n_d$, we have the Chinese remainder map $m \mapsto (m \bmod q_d)$ from $\mathbb_$ to $\prod_^ \mathbb_$ with $(m_d) \mapsto \sum_^ e_d m_d$ as its inverse where $e_d$'s are the central orthogonal idempotent elements with $\sum_^ e_d = 1 \pmod$.
Choosing $\omega_ = \omega_n^$ (therefore, $\prod_^ \omega_ = \omega_n^ = \omega_n$), we rewrite $\text_$ as follows:
:$\hat_j = \sum_^ a_i \omega_n^ = \sum_^ a_i \left( \prod_^ \omega_ \right)^ = \sum_^ a_i \prod_^ \omega_^ = \sum_^ \cdots \sum_^ a_ \prod_^ \omega_^$.
Finally, define $a_ = a_$ and $\hat_ = \hat_$,
we have
$\hat_ = \sum_^ \cdots \sum_^ a_ \prod_^ \omega_^$.
Therefore, we have the multi-dimensional DFT, $\otimes_^ \text_$.

As Algebra Isomorphisms

PFA can be stated in a high-level way in terms of algebra isomorphisms.
We first recall that for a commutative ring $R$ and a group isomorphism from $G$ to $\prod_d G_d$,
we have the following algebra isomorphism
:R \cong \bigotimes_d R _d/math> where $\bigotimes$ refers to the tensor product of algebras.
To see how PFA works,
we choose $G = (\mathbb_n, +, 0)$ and $G_d = (\mathbb_, +, 0)$ be additive groups.
We also identify R /math> as $\frac$ and R _d/math> as $\frac$.
Choosing $\eta = a \mapsto (a \bmod n_d)$ as the group isomorphism $G \cong \prod_d G_d$, we have the algebra isomorphism \eta^* : R \cong \bigotimes_d R _d/math>, or alternatively,
$\eta^* : \frac \cong \bigotimes_d \frac$.
Now observe that $\text_$ is actually an algebra isomorphism from $\frac$ to $\prod_i \frac$ and each $\text_$ is an algebra isomorphism from $\frac$ to $\prod_ \frac$,
we have an algebra isomorphism $\eta'$ from $\bigotimes_d \prod_ \frac$ to $\prod_i \frac$.
What PFA tells us is that $\text_ = \eta' \circ \bigotimes_d \text_ \circ \eta^*$ where $\eta^*$ and $\eta'$ are re-indexing without actual arithmetic in $R$.

Counting the Number of Multi-Dimensional Transformations

Notice that the condition for transforming $\text_$ into $\eta' \circ \bigotimes_d \text_ \circ \eta^*$ relies on "an" additive group isomorphism $\eta$ from $(\mathbb_n, +, 0)$ to $\prod_d (\mathbb_, +, 0)$.
Any additive group isomorphism will work.
To count the number of ways transforming $\text_$ into $\eta' \circ \bigotimes_d \text_ \circ \eta^*$,
we only need to count the number of additive group isomorphisms from $(\mathbb_n, +, 0)$ to $\prod_d (\mathbb_, +, 0)$, or alternative, the number of additive group automorphisms on $(\mathbb_n, +, 0)$.
Since $(\mathbb_n, +, 0)$ is cyclic, any automorphism can be written as $1 \mapsto g$ where $g$ is a generator of $(\mathbb_n, +, 0)$.
By the definition of $(\mathbb_n, +, 0)$, $g$'s are exactly those coprime to $n$.
Therefore, there are exactly $\varphi(n)$ many such maps where $\varphi$ is the Euler's totient function.
The smallest example is $n = 6$ where $\varphi(n) = 2$, demonstrating the two maps in the literature: the "CRT mapping" and the "Ruritanian mapping".

See also

* Bluestein's FFT algorithm
* Rader's FFT algorithm

References

* Addendum, ''ibid.'' 22 (2), 373-375 (1960) .
*
*
*
*{{cite journal , first=I. J. , last=Good , title=The relationship between two fast Fourier transforms , journal = IEEE Transactions on Computers , volume=100 , issue=3 , pages=310–317 , year=1971

FFT algorithms