Mixed Radix FFT
Mixed Radix FFT
Transform
Document placed in the public domain by Mark Borgerding,2003
Start with the definition of the Discrete Fourier Transform F for the time sequence f. The
length of f is a composite number N=mp.
N −1 2 n k
−j
F N k , f = ∑ f ne N
n=0
q=0 r=0
q=0 r=0
r=0 q=0
Factor out p from the inner exponent. Notice how similar the inner summation looks to
the original definition above.
p−1 2 k r m−1 2 qk
−j −j
F m p k , f = ∑ e N
∑ f qpr e m
r=0 q=0
Observe the time sequence f(qp+r) is a decimation of the original sequence. This is
where the term Decimation in Time (DIT) originates.
In this way, the DFT of size mp can be constructed from p DFTs of size m.
p−1 2 k r
−j
F m p k , f = ∑ e N
F m k mod m , f r
r=0