ROHINI COLLEGE OF ENGINEERING & TECHNOLOGY
3.5. DECIMATION IN FREQUENCY (DIF) RADIX 2 FFT:
In Radix-2 decimation-in-frequency (DIF) FFT algorithm, original sequence s(n)
is decomposed into two subsequences as first half and second half of a sequence. There
is no need of reordering (shuffling) the original sequence as in Radix-2 decimation-in-
time (DIT) FFT algorithm.
In this algorithm the N-point time domain sequence is converted into two
numbers of N/2 sequences. Then each N/2 point sequence is converted into two
numbers of N/4 point sequences. Thus we get four numbers of N/4 point sequences.
This process is continued until we get N/2 numbers of 2-point sequences.
It can be shown that the N-point DFT of x(n) can be realized from two numbers
of N/2 point DFTs.The N/2 point DFTs can be realized from two numbers of N/4 point
DFTs and so on. The decimation is continued up to 2-point DFTs.
Flow graph for 8 point DFT using Radix-2 DIF FFT
Fig 3.5.1.Basic Butterfly Computation
[Source: ‘Digital Signal Processing Principles, Algorithms and Applications’ by J.G. Proakis and D.G.
Manolakis page-464]
In each computation two complex numbers “a” and “b” are considered.
The sum of the two complex numbers is computed which forms a new complex
number “A”.
Then subtract complex number “b” from “a” to get the term “a-b”.The difference
term “a-b”is multiplied with the phase factor “WNk “ to form a new complex number
“B”.
Let x (n) and X(k) be N-point DFT pair.
EE8591-DIGITAL SIGNAL PROCESSING
ROHINI COLLEGE OF ENGINEERING & TECHNOLOGY
Let G1 (k) and G2 (k) be two numbers of N/2 point sequences obtained by the
decimation of X (k).
Let G1 (k) be N/2 point DFT of g1(n) and G2(k) be N/2 point DFT of g2(n).
Now, the N point DFT X(k) can be obtained from the two numbers of N/2 point DFTs
of G1(k) and G2(k) as shown below.
X (k) | k=even = G1 (k)
X (k) | k=odd = G2 (k)
Fig.3.5.2.N=8 point decimation in frequency FFT algorithm.
[Source: ‘Digital Signal Processing Principles, Algorithms and Applications’ by J.G. Proakis and D.G.
Manolakis page-464]
In the next stage of decimation the N/2 point frequency domain sequence G1 (k)
is decimated into two numbers of N/4 point sequences D11 (k) and D12 (k), and G2 (k) is
decimated into two numbers of N/4 point sequences D21 (k) and D22 (k).
Let D11 (k) and D12 (k) be two numbers of N/4 point sequences obtained by the
decimation of G1 (k).
Let D11 (k) be N/4 point DFT of d11(n),and D12(k) be N/4 point DFT of d12(n).
EE8591-DIGITAL SIGNAL PROCESSING
ROHINI COLLEGE OF ENGINEERING & TECHNOLOGY
Let D21 (k) and D22 (k) be two numbers of N/4 point sequences obtained by the
decimation of G2 (k).
Let D21 (k) be N/4 point DFT of d21 (n) and D22 (k) be N/4 point DFT of d22 (n).
Now, N/2 point DFTs can be obtained from two numbers of N/4 point DFTs as shown
below.
G1 (k) | k=even = D11 (k)
G1 (k) | k=odd = D12 (k)
G2 (k) | k=even = D21 (k)
G2 (k) | k=odd = D22 (k)
The decimation of the frequency domain sequence can be continued until the
resulting sequences are reduced to 2-point sequences. The entire process of decimation
involves,m stages of decimation where m = log 2 N.The computation of the N-point
DFT via the decimation in frequency FFT algorithm requires (N/2)log2N Complex
multiplications and Nlog2N complex additions.
EE8591-DIGITAL SIGNAL PROCESSING
