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.

56 Chapter 2 DISCRETE-TIME SIGNALS AND SYSTEMS<br />

1. Determine analytically the crosscorrelation r yx(l) interms of the autocorrelation r xx(l).<br />

2. Let x(n) =cos(0.2πn)+0.5 cos(0.6πn), α =0.1, and k = 50. Generate 200 samples of<br />

y(n) and determine its crosscorrelation. Can you obtain α and k by observing r yx(l)?<br />

P2.11 Consider the following discrete-time systems:<br />

T 1[x(n)] = x(n)u(n) T 2[x(n)] = x(n)+nx(n +1)<br />

T 3[x(n)] = x(n)+ 1 2 x(n − 2) − 1 3 x(n − 3)x(2n) T4[x(n)] = ∑ n+5<br />

k=−∞<br />

T 5[x(n)] = x(2n)<br />

T 6[x(n)] = round[x(n)]<br />

where round[·] denotes rounding to the nearest integer.<br />

1. Use (2.10) to determine analytically whether these systems are linear.<br />

2. Let x 1(n) beauniformly distributed random sequence between [0, 1] over 0 ≤ n ≤ 100,<br />

and let x 2(n) beaGaussian random sequence with mean 0 and variance 10 over<br />

0 ≤ n ≤ 100. Using these sequences, verify the linearity of these systems. Choose any<br />

values for constants a 1 and a 2 in (2.10). You should use several realizations of the above<br />

sequences to arrive at your answers.<br />

P2.12 Consider the discrete-time systems given in Problem P2.11.<br />

1. Use (2.12) to determine analytically whether these systems are time-invariant.<br />

2. Let x(n) beaGaussian random sequence with mean 0 and variance 10 over 0 ≤ n ≤ 100.<br />

Using this sequence, verify the time invariance of the above systems. Choose any values<br />

for sample shift k in (2.12). You should use several realizations of the above sequence to<br />

arrive at your answers.<br />

P2.13 For the systems given in Problem P2.11, determine analytically their stability and causality.<br />

P2.14 The linear convolution defined in (2.14) has several properties:<br />

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

: Commutation<br />

[x 1(n) ∗ x 2(n)] ∗ x 3(n) =x 1(n) ∗ [x 2(n) ∗ x 3(n)] : Association<br />

x 1(n) ∗ [x 2(n)+x 3(n)] = x 1(n) ∗ x 2(n)+x 1(n) ∗ x 3(n) :Distribution<br />

x(n) ∗ δ(n − n 0)=x(n − n 0)<br />

: Identity<br />

(2.28)<br />

1. Analytically prove these properties.<br />

2. Using the following three sequences, verify the above properties.<br />

x 1(n)=cos(πn/4)[u(n +5)− u(n − 25)]<br />

x 2(n)=(0.9) −n [u(n) − u(n − 20)]<br />

x 3(n)=round[5w(n)], −10 ≤ n ≤ 10; where w(n) isuniform over [−1, 1]<br />

Use the conv m function.<br />

P2.15 Determine analytically the convolution y(n) =x(n) ∗ h(n) ofthe following sequences, and<br />

verify your answers using the conv_m function.<br />

1. x(n) ={2, −4, 5, 3, −1, −2, 6}, h(n) ={1, −1, 1, −1, 1}<br />

↑<br />

↑<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!