Vous êtes sur la page 1sur 10

NAME:__________________________________

ECE 438 Exam 1 Solutions, 10/05/2005.


This is a closed-book exam, but you are allowed one standard (8.5-by-11) sheet of notes. No calculators are allowed. Total number of points: 100. This exam counts for 20% of your nal grade. You have 75 minutes to complete EIGHT problems. Be sure to fully and clearly explain all your answers. There will not be any discussion of grades. All re-grade requests must be submitted in writing, as stated in the course information handout.

Score 1_______ 2_______ 3_______ 4_______ 5_______ 6_______ 7_______ 8_______ 30 Total score:_______

Grader _______ _______ _______ _______ _______ _______ _______ _______ extra points to make 100 total

DTFT and DFT formulas:

DTFT X(e ) =
n=

x(n)ejn 1 2
N 1

IDTFT DFT IDFT

x(n) = X(k) = x(n) =

X(ej )ejn d

x(n)ej2kn/N 1 N
n=0 N 1

X(k)ej2kn/N
k=0

Problem 1 (25 points) Consider the following discrete-time signal: x(n) = 1, |n| 1, 0, otherwise

(a) Sketch x(n) and carefully label the plot.


+

(b) Calculate the energy of this signal, i.e., evaluate (c) Calculate the convolution of this signal with itself.

|x(n)|2 .
n=

(d) Find the smallest number L which satises the following inequality for every integer n: |x(n)| L. (e) Can this signal x(n) be the impulse response of an LTI system which is not BIBO stable? Fully justify your answer. If your answer is yes, give an example of such a system. Solution. (a)

1 1 1 o o o ... | | | ... | | | ---o---o---o---|---|---|---o---o----->n -4 -3 -2 -1 0 1 2 3

(b) The energy is 1 + 1 + 1 = 3. (c) Since this signal can be written as (n + 1) + (n) + (n 1), its convolution with itself is x(n + 1) + x(n) + x(n 1) = (n + 2) + 2(n + 1) + 3(n) + 2(n 1) + (n 2) 1, n = 2 2, n = 1 = 3, n = 0 0, otherwise (d) The number L is the magnitude of the signal which is 1. (e) An LTI system is BIBO stable if and only if its impulse response is absolutely summable. Since x is absolutely summable, it cannot be the impulse response of an unstable LTI system.

Problem 2 (5 points) The response of a discrete-time LTI system to the unit step signal u(n) is the following signal: 1, n = 0 2, n = 1 y(n) = 3, n 2 0, n 1 Find the response of this system to the unit impulse signal (n). Solution. Note that y(n) = u(n) + u(n 1) + u(n 2), y(n 1) = u(n 1) + u(n 2) + u(n 3).

Since the system is time invariant, the response to u(n 1) is y(n 1). Since the system is linear, the response to (n) = u(n) u(n 1) is y(n) y(n 1) = u(n) u(n 3) = (n) + (n 1) + (n 2).

Problem 3 (5 points) The continuous-time sinusoid sin(t) is ideally sampled at a rate of one sample per second. Is the resulting discrete-time signal periodic? If so, nd its fundamental period. Fully justify your answer. Solution. As shown in class, in order for sin(n) to be periodic, must be a rational multiple of 2. Since = 1 is not, sin(n) is not periodic.

Problem 4 (5 points). Consider a discrete-time LTI system. It is given that: the response of the system to the input signal ej0 n is the signal 2ej0 n , for any 0 such that /2 0 /2, and the response of the system to the input signal ej0 n is the zero signal, for any 0 such that /2 < |0 | . Find the response of this system to the input signal (n). Solution. The problem statement tells us that the frequency response of the system is H(ej ) = Therefore, h(n) = = (if n = 0) 1 2 1 2

2, || /2 0, /2 < ||

H(ej )ejn d
/2

2ejn d
/2 /2

1 ejn = jn =

/2

ejn/2 1 e jn n 2 sin . = n 2 1 2
/2

jn/2

If n = 0, then h(0) = Putting all this together, we get: n=0 , n = . . . , 7, 3, 1, 5, . . . n h(n) = 2 n , n = . . . , 5, 1, 3, 7, . . . 0, otherwise 1, 2 2d = 1.
/2

X(f)

11 10 9

9 10 11 f

Problem 5 (5 points). Suppose x(t) is a signal whose continuous-time Fourier transform is shown above. This signal is ideally sampled at a rate of fs samples per second. What is the smallest value of fs for which x(t) can be exactly reconstructed from its samples using an ideal lter? For reconstruction, you may use any lter of the form H(f ) = A, a |f | b 0, otherwise

Fully justify your answer and specify the lter used for reconstruction (i.e., the nonnegative numbers A, a, and b in the above formula). Hint. The answer is not fs = 22. Solution. Let the left and the right triangles be denoted by XL (f ) and XR (f ), respectively. Then X(f ) = XL (f ) + XR (f ). Since the bandwidth of each triangle is 2 Hz, and since they are symmetric, one might expect that the answer is fs = 2 Hz. When ideally sampled at this rate, the resulting sampled signal xs (t) has the following continuous-time Fourier transform:

Xs (f ) = 2
k=

X(f 2k) = 2
k=

XL (f 2k) + 2
k=

XR (f 2k).

Note that 2
k=

XL (f 2k) = 2
k=

XR (f 2k). This sum is shown in the top plot of Fig. 1. If

the height of the triangles in X(f ) is B, then the height of the triangles in these sums is 2B. The overall Xs (f ) is therefore equal two times either of these sums, as shown in the bottom plot of Fig. 1. Since the heights of the rectangles in Xs (f ) are 4B, the original signal can be perfectly reconstructed using the following ideal bandpass lter: H(f ) = Answer: fs = 2 Hz, A = 1/4, a = 9, b = 11. 1/4, 9 |f | 11 0, otherwise

2B

11 10 9

0 4B

9 10 11 f

11 10 9

9 10 11 f

Figure 1: Top: the sums 2


k=

XL (f 2k) = 2
k=

XR (f 2k). B denotes the height of the

triangles in X(f ). Bottom: Xs (f ).

Problem 6 (5 points). The DFT of a 10-point signal x1 (n) is X1 (k) = k, for k = 0, 1, . . . , 9. The DFT of a 10-point signal x2 (n) is X2 (k) = k 2 for k = 0, 1, . . . , 9. Dene a 20-point signal x(n) as follows: x1 (n/2), if n is even x(n) = x2 ((n 1)/2), if n is odd Find X(k), the 20-point DFT of x(n). Solution. Note that x1 (n) are the even-numbered samples of x(n), and x2 (n) are the odd-numbered samples of x(n). Therefore, as shown in class, X(k) = X1 (k) + ej2k/20 X2 (k) = k + ejk/10 k 2 , k = 0, 1, . . . , 9, k 10 + ejk/10 (k 10)2 , k = 10, 11, . . . , 19.

S1

S2

S3

Problem 7 (15 points) Consider the discrete-time system S which is shown above. It consists of systems S1 , S2 , and S3 connected in series. System S1 is given by the following input-output relationship: v(n) = ej0 n x(n).

System S2 is an LTI system. System S3 is given by the following input-output relationship:

y(n) = ej0 n w(n).

(a) Is the overall system S linear? (b) Is the overall system S time invariant? (c) Let the impulse response of S2 be h(n). Suppose that the input to the overall system S is x(n) = (n). Find the response y(n) of the overall system to this input, i.e., express y(n) in terms of h(n). Solution. Since v is the result of multiplying x by ej0 n , the DTFT of v is obtained by shifting the DTFT of x to the right by 0 : V (ej ) = X(ej(0 ) ). Denoting the frequency response of the system S2 by H(ej ), we have: W (ej ) = V (ej )H(ej ) = X(ej(0 ) )H(ej ) Finally, since y is the result of multiplying w by ej0 n , the DTFT of y is obtained by shifting the DTFT of w to the left by 0 : Y (ej ) = W (ej(+0 ) ) = X(ej )H(ej(+0 ) ). Taking the inverse DTFT of this equation, we see that y(n) is the convolution of x(n) with the inverse DTFT of H(ej(+0 ) ). This is true for any input signal x(n). This shows that the overall system is LTI, with impulse response equal to the inverse DTFT of H(ej(+0 ) ), i.e., ej0 n h(n). 9

Problem 8 (5 points). The signal sin(n/3) n is upsampled by a factor of 2 to obtain xu (n). In other words, x(n) = xu (2n) = x(n) for all integer n, xu (2n + 1) = 0 for all integer n.

The result of ltering xu (n) with this lter is denoted y(n). Find y(n). Solution. First note that X(ej ) = 1, || /3 0, /3 < || <

The signal xu (n) is then ltered with an LTI lter whose frequency response is: || /4 1, 2 4||/, /4 || /2 H(ej ) = 0, /2 ||

This is veried by computing the inverse DTFT of the right-hand side: 1 2


/3

ejn d =
/3

sin(n/3) ejn/3 ejn/3 = 2jn n

After ltering with H(ej ), the central alias is preserved exactly, and the alias at = gets canceled: Y (ej ) = Xu (ej )H(ej ) = Inverting this, we get the signal y: y(n) = 1 2
/6

As shown in class, upsampling by a factor of L squeezes the DTFT by a factor of L: 1, || /6 j j2 0, /6 < || < 5/6 Xu (e ) = X(e ) = 1, 5/6 || 1, || /6 0, /6 < || <

ejn d =
/6

sin(n/6) ejn/6 ejn/6 = 2jn n

10

Vous aimerez peut-être aussi