Professional Documents
Culture Documents
FFT PDF
FFT PDF
Computation
6.2
Decimation-in-
of the Discrete
Time
Fourier Transform
FFT Algorithms
X(k)
k = 0, 1, ...,
N -1
(6.9)
and separating x(n) into its even- and odd-numbered points we obtain
X(k)
: !
x(n)W'ff
n even
!
x(n)WNk
n odd
But w;"
W~ = e-2i(2w/NI = e-i!
Consequently
(N/2)-1
!
x(2r)W~/2
r=O
=
G(k)
!./(NI2)
WNI2
as
W~
(N/2)-1
!
x(2r + 1)W~/2
r-O
W~H(k)
2,
1 for
X(k).
Figure
.
6.3
indicates
the
computation
involved
in
computing
x(O)~
(0)
x(2)~
(1)
x(4)~
X(2)
X(k)
x(6)01
x( 1)0.-1
x(3)~
I~'XX'~
["77\
'\ -~-X(5)
x(5J0.--1
IHI2J7
"1" -
x(7)~
Fig.6.3
~-
.~ X(7)
WN
H(O) by WJ.
<R
292
Computation
or
1!1
911!
G(k)
(6.12)
Similarly,
(N/4)-1
H(k)
!
h(21)W~/4
1=0
(N/4-tl
+
W~/2
!
h(21 + 1)W~/4
1=0
(6.13)
Thus if the four-point DFTs in Fig. 6.3 are computed according to Eqs.
(6.12) and (6.13), then that computation would be carried out as indicated
in Fig. 6.4. Inserting the computation indicated in Fig. 6.4 into the flow
graph of Fig. 6.3, we obtain the complete flow graph of Fig. 6.5. Note that
we have used the fact that WN/2 = w'i..
For the eight-point DFT that we have been using as an illustration, the
computation has been reduced to a computation of two-point DFTs. The
two-point DFT of, for example, x(O) and x(4), is depicted in Fig. 6.6. With
the computation of Fig. 6.6 inserted in the flow f7rHnh of Fif7 fi , Wf' ()ht~in
x(O)~
G(O)
x(4 ) 0
,
(1 )
2)
)
N/2
Fig.6.4
Fig.6.5
Result
of substitutIng
X(O)~
( 4) L
wZ = 1
~
W
WZ=
Fig.6.6
Flow
Fig. 6.3
graph
N/2=-1
N
of a two-point
DFT.
293
294
Computation
Fig.6.7
Flow graph
eight-point
of complete
decimation-in-time
DFT computation.
decomposition
of an
For the more general case with N a power of 2 greater than 3, we would
proceed by decomposing the N/4-point transforms in Eqs. (6.12) and (6.13)
into N/8-point transforms, and continue until left with only two-point
transforms. This requires v stages of computation, where v = log2 N. Previously we found that in the original decomposition of an N-point transform
into two N/2-point transforms, the number of complex multiplications and
additions required was N + 2(N/2)2. When the N/2-point transforms are decomposed into N/4-point transforms, then the factor of (N/2)2 is replaced by
N/2 + 2(N/4)2, so the overall computation then requires N + N + 4(N/4)2
complex multiplications and additions. If N = 2., this can be done at most
v = log2 N times, so that after carrying out this decomposition as many times
as possible the number of complex multiplications and additions is equal to
N log2 N.
The flow graph of Fig. 6.7 displays the operations explicitly. By counting
bran~hes with transmittances of the form WN, we note that each stage has
N complex multiplications and N complex additions. Since there are log2 N
stages, we have, as before, a total of N log2 N complex multiplications and
additions. This is the substantial computational savings that we have previously indicated was possible. We shall seethat the symmetry and periodicity
of wN can be exploited to obtain further reductions in computation.
6.2.1
In-Place
Computations
The computational
computation
of the discrete
Fourier
transform.
What
is important
for the
in the