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.

204 Chapter 5 THE DISCRETE FOURIER TRANSFORM<br />

1. y(n) =x((n − 5)) 10<br />

2. y(n) =x((n + 4)) 10<br />

3. y(n) =x((3 − n)) 10<br />

4. y(n) =x(n)e j3πn/5<br />

5. y(n) =x(n) ○10<br />

x((−n)) 10<br />

Verify your answers using MATLAB.<br />

P5.17 The first six values of the 10-point DFT of a real-valued sequence x(n) are given by<br />

{10, −2+j3, 3+j4, 2 − j3, 4+j5, 12}<br />

Determine the DFT of each of the following sequences using DFT properties.<br />

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

2. x 2(n) =x((n + 5)) 10<br />

3. x 3(n) =x(n)x((−n)) 10<br />

4. x 4(n) =x(n) ○10<br />

x((−n)) 10<br />

5. x 5(n) =x(n)e −j4πn/5<br />

P5.18 Complex-valued N-point sequence x(n) can be decomposed into N-point circular-conjugatesymmetric<br />

and circular-conjugate-antisymmetric sequences using the following relations<br />

x ccs(n) △ = 1 2 [x(n)+x∗ ((−n)) N ]<br />

x cca(n) △ = 1 2 [x(n) − x∗ ((−n)) N ]<br />

If X R(k) and X I(k) are the real and imaginary parts of the N-point DFT of x(n), then<br />

DFT [x ccs(n)] = X R(k) and DFT [x cca(n)] = jX I(k)<br />

1. Prove these relations property analytically.<br />

2. Modify the circevod function developed in the chapter so that it can be used for<br />

complex-valued sequences.<br />

3. Let X(k) =[3 cos(0.2πk)+j4 sin(0.1πk)][u(k) − u(k − 20)] be a 20-point DFT. Verify<br />

this symmetry property using your circevod function.<br />

P5.19 If X(k) isthe N-point DFT of an N-point complex-valued sequence<br />

x(n) =x R(n)+jx I(n)<br />

where x R(n) and x I(n) are the real and imaginary parts of x(n), then<br />

DFT [x R(n)] = X ccs(k) and DFT [jx I(n)] = X cca(k)<br />

where X ccs(k) and X cca(k) are the circular-even and circular-odd components of X(k) as<br />

defined in Problem P5.18.<br />

1. Prove this property analytically.<br />

2. This property can be used to compute the DFTs of two real-valued N-point sequences<br />

using one N-point DFT operation. Specifically, let x 1(n) and x 2(n) betwoN-point<br />

sequences. Then we can form a complex-valued sequence<br />

x(n) =x 1(n)+jx 2(n)<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!