Professional Documents
Culture Documents
Quiz 1 Sol
Quiz 1 Sol
4pt0pt
Directions: The exam consists of 5 problems on pages 2 to 19 and work space on pages 20 and
21. Please make sure you have all the pages. Tables of Fourier series properties
are supplied to you at the end of this booklet. Enter all your work and your
answers directly in the spaces provided on the printed pages of this booklet.
Please make sure your name is on all sheets. DO IT NOW!. All sketches must
be adequately labeled. Unless indicated otherwise, answers must be derived or
explained, not just simply written down. This examination is closed book, but
students may use one 8 1/2 11 sheet of paper for reference. Calculators may not
be used.
NAME: SOLUTIONS
Check your section Section
Time
10-11
11-12
1- 2
11-12
12- 1
12- 1
10-11
11-12
Rec. Instr.
Prof. Zue
Prof. Zue
Prof. Gray
Dr. Rohrs
Prof. Voldman
Prof. Gray
Dr. Rohrs
Prof. Voldman
Please leave the rest of this page blank for use by the graders:
Problem
1
No. of points
18
20
20
21
21
Total
100
Score
Grader
PROBLEM 1 (18%)
SYSTEM A:
SYSTEM B:
SYSTEM C:
(x[n] + 1)
y[n] =
x [k + 1] x[k]
k=1
Circle YES or NO for each of the following questions for each of these three systems.
SYSTEM A
SYSTEM B
SYSTEM C
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
YES
NO
NAME:
System C: NO
Time Invarience
System A: NO
System B: NO
System C: NO
Causality
System A: NO
System B: YES
System C: NO
Stability
System A: YES
System B: NO
( 12 )n as n
System C: NO
if x[n] = 1 y[n] =
3
k=1
2, y as n
PROBLEM 2 (20%)
Consider a DT LTI system, H2 with a unit sample response h2 [n] = h[n] h[n + 1], as shown
below, where h[n] = [n] [n 1]. You may remember from one of the lectures that h[n]
can be viewed as the unit sample response of a DT LTI system that acts as an edge detector.
The purpose of this problem is to develop an edge detector that is robust against additive
noise.
h2 [n]
1
System H2
p[n]
x[n]
h2 [n]
y[n]
d[n]
Part a. Assume that the input to the system, p[n] is as shown below, and there is no noise,
i.e., d[n] = 0 and p[n] = x[n]. Provide a labeled sketch of y[n], the output of the system.
p[n]
y[n]
n
7
2
4
NAME:
x[n] = p[n],
Using DT convolution sum, y[n] is the sum of 3 copies of p[n] shifted and scaled according
to h2 [n]
p[n + 1]
2p[n]
4
+
2
p[n 1]
3
Part b. For the same input signal as Part a., now assume that the noise signal is
d[n] = [n + 1].
Provide a labeled sketch of the output y[n], i.e., the response to x[n] = p[n] + d[n].
y[n]
n
7
1
2
3
NAME:
d[n] hs [n]
Adding the above (d[n] h2 [n]) to the answer in Part a, we get y[n] for this part which is
shown on page 6.
Part c. In order to use system H2 as a part of an edge detector, we would like to add an
LTI system Hs whose unit sample response, hs [n] is shown below. System Hs smoothes out
effect of noise on x[n]. The overall system can be represented as below:
hs [n]
p[n]
System Hs
System H2
hs [n]
h2 [n]
x[n]
ys [n]
d[n]
Provide a labeled sketch of the overall output ys [n], when p[n] and d[n] are exactly the same
as in Part b.
ys [n]
n
7
2
3
8
NAME:
x[n] h2 [n]
2
n
7
1
2
3
Now we just need to convolve the above signal with hs [n]. We can do this convolution with
ipping and sliding hs [n].
hs [n k]
n1 n n+1
The result is the desired ys [n] and is shown on page 8.
PROBLEM 3 (20%)
Consider the CT LTI system whose impulse response is given as:
h(t)
y(t)
h(t)
x(t)
t
1
x(t)
(1)
(1)
(1)
(1)
t
1
y(t)
2
1
t
7
10
NAME:
1
t
7
1
t
7
1
t
7
1
t
7
+
.
.
Adding the shifted and scaled pulses, we get y(t) as shown on page 10.
11
Part b. For this part, the output y(t) is periodic and is depicted below:
y(t)
2
4
6
3 2
8 9
2 3
2
Provide a labeled sketch of the input x(t) that produces this y(t).
x(t)
1
t
10 9 8 7 6 5 4 3 2 1
1
12
10
NAME:
There are different ways to solve this problem, and here is one of them:
dt
system.
y(t)
4
2
8 9
2
It can be seen that y(t) is the sum of a number of scaled and shifted versions of h(t). Alter
natively,: y(t) = p(t) h(t), where p(t) is shown below:
p(t)
(2)
(2)
4
6
8 9
(2)
We know that
t y(t) = x(t) h(t) x(t) = u1 (t) p(t)
x(t) = p(v)dv = x(t)
+ c, where the constant c restores the DC level of the periodic
signal.
x(t)
c+1
t
10 9 8 7 6 5 4 3 2 1
c1
To nd the value of the constant c, we compare the value of y(0) with x(t) h(t)| t=0 , i.e. the
area under the curve of x(t)h(-t).
y(0) = 2 = x(t) h(t)|t=0 = (1 + c)(2) = 2 c = 0.
13
10
PROBLEM 4 (21%)
Consider the following periodic triangular wave shown below:
x(t)
1/4
1 3/4
1/4
ak =
0,
4j
k2 2
sin(k 2 ),
3/4
k=0
k=
0
14
NAME:
x(t)
1/4
3/4
1 3/4
1/4
Period= T = 1 0 = 2/T = 2.
a0 = T1 T x(t)dt = T1 (Area under the curve for one period)= 0 = a0
Finding ak=0
using the analysis equation will be tedious. Instead, we will use the integration
3/4
1/4
1/4
3/4
Let x(t) bk
bk
1
=
T
= 8e
ak
x(t)e
jk0 t
T
jk0 (1/4)
dt =
1/2
1/2
jk0 (1/4)
8e
= 16j sin(k0 /4)
= 16j sin(k ).
2
=
bk (integration property)
(jk0 )2
4j
16j
sin(k ) = 2 2 sin(k ).
2
2
k (2)
2
k
2
Part b. Consider a causal LTI system, S, whose input-output relation is characterized by the
following stable linear constant coefcient differential equation:
d2 y
dy
+ 4 + 4 2 y(t) = 4 2 x(t),
2
dt
dt
where x(t) is the input and y(t) is the output of the system. Suppose x(t) shown on the
previous page is applied to the system S as an input. Let bk be the Fourier coefcients of the
corresponding output y(t). Find b3 and b3 .
b3 =
4j
9 2 (8+j6)
16
b3 =
4j
.
9 2 (8+j6)
NAME:
1
4 2
=
.
2
2
(j) + 4j + 4
1 + j/ 2 /4 2
4j
1
4j
1
=
sin 3
= 2
2
2
2
2
(3)
2
1 + j6/ (6) /4
9 (1 + j6 9)
b3 =
4j
9 2 (8
b3 = b3 =
+ 6j)
1
4j
4j
=
.
2
2
9 8 6j
9 (8 + 6j)
17
PROBLEM 5 (21%)
You are given the following facts about a discrete time sequence x[n]:
(a) x[n] is real and odd.
(b) x[n] is periodic with period N = 6.
1
|x[n]|2 = 10.
(c)
N n=<N >
(d)
(1)n/3 x[n] = 6j.
n=<N >
18
NAME:
ak is odd ak = ak a3 = a3
(5.2)
Another result that we can conclude in this part is that ak has only 6 distinct values. So
(c)
1
N
n=<N >
|x[n]|2 = 10.
By Persevals therom:
1
N
n=<N >
|x[n]|2 =
k=<N >
|ak |2
()
n=<N >
Remembering that ej
= 1
(1)n/3 x[n] =
n=<N >
n=<N >
ejn/3 x[n]
n=<N >
= N
1
N
x[n] ejk0 n
n=<N >
= Na1 = 6a1 = 6j
a1 = j and a1 = j a1 = j and a1 = j
From (*): 2|a2 |2 + 2|a1 |2 = 2|a2 |2 + 2(1)2 = 10 |a2 | = 2
19
k=1
NAME:
x[n] =
ak ejk0 n
k=<N >
a2 ej(2)0 n + a1 ej(1)0 n + a1 ej(1)0 n + a2 ej(2)0 n
a2 ej20 n a1 ej0 n + a1 ej0 n + a2 ej20 n
a2 ej20 n a2 ej20 n + a1 ej0 n a1 ej0 n
=
=
=
=
= a2 (2j) sin(20 n) + a1 (2j) sin(0 n)
= (2jp)(2j) sin(20 n) + (j)(2j) sin(0 n)
= 4p sin(20 n) 2 sin(0 n)
3
= (4p 2)
2
x[1] > 0 4p2 > 0 p = 1, regardless of the sign used for the second term.
x[n] = 4 sin
2
n
2
sin
n
3
3
20
NAME:
Work Page
21
NAME:
Work Page
22