02.10.2019 Views

UploadFile_6417

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

180 Chapter 5 THE DISCRETE FOURIER TRANSFORM<br />

The quantity |X(k)|2<br />

N<br />

is called the energy spectrum of finite-duration sequences.<br />

Similarly, for periodic sequences, the quantity | ˜X(k)<br />

N<br />

|2 is called<br />

the power spectrum.<br />

5.5 LINEAR CONVOLUTION USING THE DFT<br />

One of the most important operations in linear systems is the linear convolution.<br />

In fact, FIR filters are generally implemented in practice using this<br />

linear convolution. On the other hand, the DFT is a practical approach<br />

for implementing linear system operations in the frequency domain. As we<br />

shall see later, it is also an efficient operation in terms of computations.<br />

However, there is one problem. The DFT operations result in a circular<br />

convolution (something that we do not desire), not in a linear convolution<br />

that we want. Now we shall see how to use the DFT to perform a linear<br />

convolution (or equivalently, how to make a circular convolution identical<br />

to the linear convolution). We alluded to this problem in Example 5.15.<br />

Let x 1 (n) beanN 1 -point sequence and let x 2 (n) beanN 2 -point<br />

sequence. Define the linear convolution of x 1 (n) and x 2 (n) by x 3 (n),<br />

that is,<br />

x 3 (n) =x 1 (n) ∗ x 2 (n)<br />

∞∑<br />

= x 1 (k)x 2 (n − k) =<br />

k=−∞<br />

N∑<br />

1−1<br />

0<br />

x 1 (k)x 2 (n − k) (5.43)<br />

Then x 3 (n) is a (N 1 + N 2 − 1)-point sequence. If we choose N =<br />

max(N 1 ,N 2 ) and compute an N-point circular convolution x 1 (n) N○<br />

x 2 (n), then we get an N-point sequence, which obviously is different<br />

from x 3 (n). This observation also gives us a clue. Why not choose<br />

N = N 1 + N 2 − 1 and perform an (N 1 + N 2 − 1)-point circular convolution?<br />

Then at least both of these convolutions will have an equal<br />

number of samples.<br />

Therefore let N = N 1 + N 2 − 1 and let us treat x 1 (n) and x 2 (n) as<br />

N-point sequences. Define the N-point circular convolution by x 4 (n).<br />

x 4 (n) =x 1 (n) N○ x 2 (n) (5.44)<br />

[ N−1<br />

] ∑<br />

= x 1 (m)x 2 ((n − m)) N R N (n)<br />

m=0<br />

[ N−1<br />

]<br />

∑ ∞∑<br />

= x 1 (m) x 2 (n − m − rN) R N (n)<br />

m=0 r=−∞<br />

Copyright 2010 Cengage Learning. All Rights Reserved. May not be copied, scanned, or duplicated, in whole or in part. Due to electronic rights, some third party content may be suppressed from the eBook and/or eChapter(s).<br />

Editorial review has deemed that any suppressed content does not materially affect the overall learning experience. Cengage Learning reserves the right to remove additional content at any time if subsequent rights restrictions require it.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!