Professional Documents
Culture Documents
DBCET, Azara
CHAPTER 1
RADIX 2 DECIMATION IN FREQUENCY (DIF) ALGORITHM
1.1 INTRODUCTION
A DFT decomposes a sequence of values into components of different frequencies. This
operation is useful in many fields but computing it directly from the definition is often too slow to be
practical. A Fast Fourier Transform (FFT) is a way to compute the same result more quickly:
computing a DFT of N points using the definition, takes O(N2) arithmetical operations, while an FFT
can compute the same result in only O(N log N) operations. The difference in speed can be substantial,
especially for long data sets where N may be in the thousands or millionsin practice, the
computation time can be reduced by several orders of magnitude in such cases, and the improvement
is roughly proportional to N/log(N). This huge improvement makes many DFT-based algorithms
practical; FFTs are of great importance to a wide variety of applications, from digital signal
processing and solving partial differential equations to algorithms for quick multiplication of large
integers.
1.2 FAST FOURIER TRANSFORMS ARE FAST DFT ALGORITHMS.
It may be noted that the number of complex multiply and add operations required by the
simple forms (both the DFT and IDFT) is of order N2. This is because there are N data points to
calculate, each of which requires N complex arithmetic operations. Therefore they have algorithmic
complexity O (N2). Thus the DFT will not be very useful for the majority of practical DSP applications
if the complexity is not reduced. This is enabled by a number of different 'Fast Fourier Transform'
(FFT) algorithms.
1.2.1 RADIX 2 ALGORITHMS
The popular 'Radix 2' algorithms are useful if N is a regular power of 2 (N=2p). These
algorithms have complexity of only O(NlogN). If we assume that algorithmic complexity provides a
direct measure of execution time (and that the relevant logarithm base is 2) then the ratio of execution
times for the (DFT) vs. (Radix 2 FFT) can be expressed:
For a 1024 point transform (p=10, N=1024), this gives approximately 100 fold speed
improvement. This is why FFT's are important. Of course the actual speed improvement that is
If N is even, the above sum can be split into 'top' (n=0...N/2-1) and
'bottom' (n=N/2...N-1) halves and re-arranged as follows:
If we now consider the form of this result for even and odd valued k separately, we can see
how this result enables us to express an N point FFT in terms of 2 (N/2) point FFT's.
Even k, k=2k' (k'=0..N/2-1):
or equivalently,
or equivalently..
The process of dividing the frequency components into even and odd parts is what gives this algorithm
its name 'Decimation In Frequency'. If N is a regular power of 2, we can apply this method recursively
until we get to the trivial 1 point transform. The factors TN are conventionally referred to as 'twiddle
factors'.
1.4 A RECURSIVE DIF FFT ROUTINE.
Given the above results, we can now have a 'first stab' at a recursive routine to implement this
algorithm (in a hypothetical Pascal like programming language which supports complex numbers and
allows arrays as function arguments and results):
FUNCTION DIF(N,f);
LOCAL N',n,fe,fo,Fe,Fo,k',F;
IF N==1
THEN RETURN(f); {trivial if N==1}
ELSE BEGIN
{perform 2 sub-transforms}
{even subset}
Dropping the constant scaling factors (including the log base) we get an algorithmic complexity of
O(N.logN)
{do nothing}
ELSE BEGIN
N':=N>>1; {shift right to get size of sub-transforms}
BaseO:=BaseE+N'; {split block into 2 halves}
FOR n:=0 TO (N'-1) DO
BEGIN
e:= f[BaseE+n]+f[BaseO+n];
o:=(f[BaseE+n]-f[BaseO+n])*T(N,n);
f[BaseE+n]:=e;
f[BaseO+n]:=o;
END;
DIF(BaseE,N',f); {even sub-transform}
DIF(BaseO,N',f); {odd sub-transform}
END;
This version of the DIF routine is a little simpler and more efficient than the first, but has the
disadvantage that the output is in 'jumbly' (bit reversed) order. This may or may not be a serious
problem, depending on what the output is to be used for and whether or not the
processor/programming language supports bit reversed addressing (most DSP's do). If bit reversed
addressing is not available then you may need to produce a bit reversed index look up table to access
the output.
Let us consider the last DIF FFT pass (N=2). In this case, T2(0)=1 is the only twiddle factor
used. So, the entire last pass consists of trivial butterflies. Similarly, the first butterfly of any sub-block
will use TN(0)=1. In general, in pass P (P=0..p-1), there are BP (=2P) sub-blocks and therefore
2Pbutterflies which use a twiddle factor of +1.
So, for a 2p point DIF FFT, the proportion of trivial butterflies is about 3/p. If this shortcut is
exploited, then large FFT's benefit less than small FFT's. For example, in a 512 point (p=9) DIF FFT
about 1/3 of the butterflies will be trivial.
1.8 COMPUTING DIF TWIDDLE FACTORS
The below given diagram shows the signal flow diagram for an 8-point radix-2 DIF FFT.
and F is decomposed as H:
In terms of the original 1D arrays, these two equations correspond to even and odd k respectively:
CHAPTER 2
RADIX 2 DECIMATION IN TIME (DIT) ALGORITHM.
If N is even, the above sum can be split into 'even' (n=2n') and 'odd' (n=2n'+1) halves,
where n'=0..N/2-1, and re-arranged as follows:
This process of splitting the 'time domain' sequence into even an odd samples is what gives the
algorithm its name, 'Decimation In Time'. As with the DIF algorithm, we have succeeded in expressing
an N point transform as 2 (N/2) point sub-transforms. The principal difference here is that the order we
do things has changed. In the DIF algorithm the time domain data was 'twiddled' before the two subtransforms were performed. Here the two sub-transforms are performed first. The final result is
obtained by 'twiddling' the resulting frequency domain data. There is a slight problem here, because
the two sub-transforms only give values for k=0..N/2-1. We also need values for k=N/2..N-1. But from
the periodicity of the DFT we know:
Also,
So, for k=0..N/2-1:
and
where
This will produce a simple recursive DIT FFT routine for any N which is a regular power
of 2 (N=2p).
2.2 A RECURSIVE DIT FFT ROUTINE.
Given the above results, we can now have a 'first stab' at a recursive routine to
implement this algorithm (in a hypothetical Pascal like programming language which
supports complex numbers and allows arrays as function arguments and results):
{f is an array of size N=2^p}
FUNCTION DIT(N,f);
LOCAL N',n',fe,fo,Fe,Fo,k,x,F;
IF N==1
THEN
ELSE
BEGIN
{perform 2 sub-transforms}
subset}
Dropping the constant scaling factors (including the log base) we get an algorithmic complexity of
O(N.logN)
2.4 A RECURSIVE 'IN PLACE' DIT FFT ROUTINE.
We get a better and more efficient (recursive) in-place DIT routine as follows:
{Perform in place DIT of N points starting at position BaseT.
DIT(0,N,f) performs DIT FFT on entire array f, N= size of f
N.B. The input array f is in bit reversed order! So all the
'even' input samples are in the 'top' half, all the 'odd'
input samples are in the 'bottom' half..etc (recursively).
}
PROCEDURE DIT(BaseT,N, VAR f); {f is an external array}
LOCAL N',BaseB,k,top,bot;
IF N==1
THEN
{do nothing}
ELSE BEGIN
N':=N>>1; {shift right to get size of sub-transforms}
BaseB:=BaseT+N'; {split block into 2 halves}
DIT(BaseT,N',f); {even n}
DIT(BaseB,N',f); {odd n}
subset}
The below given diagram shows the signal flow diagram for an 8-point radix-2 DIT FFT.
Here's an algorithm for computing the individual twiddle factor angles of a radix-2 DIT FFT.
Let us consider the above figure showing the butterfly signal flow of an 8-point DIT FFT.
The N-point DIT FFT has log2(N) stages, numbered P = 1, 2, ..., log2(N).
Each stage comprises N/2 butterflies.
Not counting the 1 twiddle factors, the Pth stage has N/2 twiddle factors, numbered k = 0, 1,
2, ..., N/21 as indicated by the upward arrows at the bottom of Figure 3.
Given those characteristics, the kth DIT twiddle Q factor for the Pth stage is computed using:
kth DIT twiddle factor Q = [k2P/N]bit-rev
where 0 k N/21. The q operation means the integer part of q. The [z]bit-rev function represents the
three-step operation of:
[1] convert decimal integer z to a binary number represented by log2(N)1 binary bits,
In terms of the original 1D arrays, these two equations correspond to 'top' and 'bottom' k respectively:
CONCLUSION.
3.1 DIF OR DIT?
In terms of computational work load, there would appear to be very little to choose between
the DIF and DIT algorithms. Both perform exactly the same number of butterflies. Each butterfly
requires exactly one complex multiply and two complex adds. Both algorithms use exactly the same
number if trivial (and 'semi-trivial') butterflies.
The most significant difference between simple DIF and DIT algorithms is that DIF starts with
normal order input and generates bit reversed order output. In contrast, DIT starts with bit reversed
order input and generates normal order output. So if both forward and inverse transforms are required
and bit reversed addressing isn't available, then the choice would seem clear. Use DIF for the forward
transform and DIT for the inverse transform. (For the inverse transform you will need to conjugate the
twiddle factors.) Unfortunately, the issue isn't quite so simple. If your performing FFT's on pure real
data it may be simpler to use a modified DIT for the forward transform and a modified DIF for the
inverse transform.
It is worth noting that if the FFT (DIF or DIT) uses 'hard wired' -j trivial butterflies, then one
will need separate routines forward and inverse transforms in any case. You can easily conjugate a
twiddle factor table, but the 'hard wired' -j butterflies can't use conjugated twiddle factors without rewriting the code.
If the processor supports bit reversed addressing (see below), then the physical ordering of the
input or output data is not an important efficiency consideration. One should try coding both the DIF
and DIT butterflies and see which is the most efficient. (In a DSP that supports single cycle adds,
multiplies and multiply/accumulates, both should take about 8 clock cycles).
What all this shows is that both the Radix 2 DIF and DIT algorithms can be regarded simply as
slightly different implementations of the same more general algorithm. The only difference is that if
you decompose a 2p point transform into 2 rows and 2 p-1 columns you get the DIF algorithm.
Decomposing into 2p-1 rows and 2 columns yields the DIT algorithm.
The corresponding butterflies are really just an optimization which combines multiplication by
the generalized twiddle factors and a 2 point FFT into the same operation. In the DIF algorithm
butterfly, the twiddle factors (one of which is 1) are applied after the 2 point (column) FFT. In the DIT
algorithm butterfly, the twiddle factors (one of which is again 1) are applied before the 2 point (row)
FFT.
Fast
Fourier
Transforms
Algorithms.01
1.2.1
Radix
Algorithms.
01
1.3
The
Radix
Decimation
In
Frequency
(DIF)
Algorithm.02
1.4
Recursive
DIF
FFT
Routine03
1.5 DIF FFT Algorithmic Complexity (Why It's
Fast).
..04
1.6
Recursive
'In
Place'
DIF
FFT
Routine.05
1.7
Twiddle
Factor
Tricks.
.06
1.8
Computing
DIF
Twiddle
Factors.
07
1.9
DIF
Decomposition08
CHAPTER 2
RADIX 2 DECIMATION IN TIME (DIT) ALGORITHM
2.1
The
Radix
Decimation
Algorithm.10
In
Frequency
(DIF)
2.2
Routine11
2.3 DIT FFT Algorithmic Complexity (Why It's Fast).
..12
2.4
Recursive
'In
Place'
DIT
FFT
Routine.12
2.5
Twiddle
Factor
Tricks..13
2.6
Computing
DIT
Twiddle
Factors14
2.7
DIT
Decomposition15
CONCLUSION
3.1 DIF Or
DIT?..........................................................................................................................
...........................17
BIBLIOGRAPHY
1. Babu, P. Ramesh, Digital Signal Processing, Scitech Publications (India) Pvt. Ltd., Hyderabad:
February, 2010.
2. Clausen, Michael and Meinard Muller, A Fast Program Generator of Fast Fourier Transforms,
Bonn Germany.
3. http://www.en.wikipedia.org/wiki/Fast_Fourier_transform
4. http://www.engineeringproductivitytools.com/stuff/T0001/PT08.HTM