... Proakis and D G Manolakis, Digital Signal Processing ± Principles, Algorithms, and Applications, 3rd Ed., Englewood Cliffs, NJ: Prentice-Hall, 1996 [11] A Bateman and W Yates, Digital Signal Processing ... and h(n) are real-valued N-periodic sequences, y(n) is the circular convolution of x(n) and h(n) defined as y
n x
n h
n, n 0, 1, , N À 1, 7:1 :26 312 FAST FOURIER TRANSFORM AND ITS ... second step of N-point DFT, N −1 Figure 7.7 Flow graph of 2-point DFT 318 FAST FOURIER TRANSFORM AND ITS APPLICATIONS Since W2 and W2 eÀp À1, we have X
0 x
0 x
1 and X
1 x
0...