MITRES 6 008S11 Sol04 PDF
MITRES 6 008S11 Sol04 PDF
MITRES 6 008S11 Sol04 PDF
Solution 4.1
+C0
X(ejW) = 1
x(n) e-jWn
(a)
thus:
+O0
n=-o
6(n -
X(e") =W
3) e-jwn = e-jw3
n=-o
(b)
1 +
X(e j)
(c) X(e W)
=2
e2 'ejW + 1
2f
an e-jn
=2 (ae jw)n
n=O
+3
n=O
1 - ae
6
n=O
n=-3
7w
e- wn
e-jon = ej3
) =E
(d) X(e
= 1 + cosw
sin(w)
Solution 4.2
y(n) =
y(n) =
[n
thus,
(b)
n+l
n+l
a
and
u(n)
n
(n)
.
H(e 3 ) = 1
1
1
-
a-j
and
X(e j)
-e
S4.1
(a)
00
=2
Y(eS)
n+l _ n+l
e-jwn
n=0
jon
=n
-jwn
n= C,
6 a-
1 -
Be~5"
=(1 -
-a
Se -3w
(1 - ae -
1 -
ae- j
Solution 4.3
+0
+00
Xa(e j)
(a)
kx(n)e-jon
x(n)e-jwn
k X(ej)
x(n
Xb(e)
(b)
k
n=-o
n=-o
n0 ) e-jn
n=-co
m =
or
n0
Xb (e)
n = m + n0
e-
x(m)
m=-
j(m+n0
e-jon0 x(m)
m=-00
=e-jon 0
X(e jw)
(c)
+0
x(n) e-jwn
X (e w) =
n=-o
thus
dX (ej w)
=
de)
dw
(-jn) x(n) e
n=-o
+C0
or
dX(e j
n x(n)
dw
S4.2
Xc
(e
e-jon
j ton
e-jom
Solution 4.4
(a)
IHa (j)1
-a
e jQ t dt=
h (t)
aeat e-jQ t
0+
|II(jQ)|
Thus
2 + a2
is as sketched below:
IH(jQ) I
Figure
(b)
S4.4-1
thus Hd (e
With
ca
- T e-3
-j
e-aT
jO
) = 1, c
-e-aT
a
a
this choice of c
(1-
IH (eJ ) 12
d
For Hd(e
thus lHd(ejW)I
2e-aT
eaT 2
cos w +
aT
is:
Figure S4.4-2
S4.3
Solution 4.5
2:(j
1
A
T
x A (jQ2)
r=-co
and
X(e
+ 2'rr
JW)
W e
X
XA()
XA (j)
IT
Let us assume that XA(j) has some arbitrary shape as indicated below.
Since we are assuming that T is sufficiently small to prevent aliasing,
.
Then XA(jQ) and X(e3W) are as
XA(jQ) must be zero for J|I >
Y(ejW) corresponding to the output of the
filter and YA(jQ) and YA(jQ) follow in a straightforward way and are
as indicated in figure S4.5-1. Thus yA(n) could be obtained directly
rad/sec and for the case in part (b) the cutoff frequency
x 10
is
is
S4.4
4
x 10 rad/sec.
XA (j 0)
1
XA
1
-10
7T
7T
XA (e)
Y(e
-2 r
100000
Tr
YA
K>
27T
27T
4
T
K>
K
7T
Tr
2
4 T 4T
-p
YA (j )
7T
7T
Figure S4.5-1
S4.5
Solution 4.6
(1) and (2) can be verified by direct substitution into the inverse
[x(n))
Re
[x(n)]
[x(n) + x
(X (e)
Ix(n) - x
(n).
X(elw) + X (eW)]
X (e~)3
Solution 4.7*
x(O)
X(e j)
dw
-Jr
Thus, with y(n) denoting the convolution of f(n) and g(n) and since
Y(e
But
yfn)
f(k)
g(n -
k)
k=-co
so
y(O) =
f(k) g(-k)
k=-o
Since f(k) is zero for k < 0 and g(-k) is zero for k > 0,
g(O)
k=-o
Solution 4.8*
(a)
Method A:
Then
Finally,
k=-o
s(n) = r(-n) =
h(k) h(k + n)
k=-o
h(k) h(k + n)
Consequently, h1 (n) =
k=- 0
S4.6
h(k) h(-n+k)
h(k) h(k -
(-n) =
n)
k=-o
letting k - n = r,
h(n + r) h(r)
h1 (-n) =
k=-o
Specifically,
Let
g(n) = g(-n).
Also,
R(e
and
S(ejW)
) = X (e
= R (e
Then
H (e
) = IH(e
) = X (e
G, (e
) H (e W) H(e)
= X (ejW)
) H (e)
IH(e j)12
|H(ejW )12
= X(e W)
Thus,
Ge)
2.
)|
characteristic.
(b)
Method B:
)
G (e
X(e W) H(e )W
R(e W)
X (ej)
H(e )W
Y(e
G (ej)
+ R(e )W
)-=)
-
X(e j)
= X(e j)
[H(ejW) + H*(e
)]
[2 Re H(ejW)]
) = 2
IH(e
)I
preferable method.
S4.7
H (eJ])
Figure S4.8-1
(e"')
7
3-7
Figure S4.8-2
S4.8
MIT OpenCourseWare
http://ocw.mit.edu
The following may not correspond to a particular course on MIT OpenCourseWare, but has been
provided by the author as an individual learning resource.
For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.