Documente Academic
Documente Profesional
Documente Cultură
Solution 3.1
To correspond to a stable system, the unit sample response must be
absolutely summable. For each system
+00
(ii)
L
n=O
0
2n
-n=2
00
(iii)
n n=O
+00
y(n) =
k=-o
x(k) h(n -
k)
k)
n
y(n) = x(k) h(n k)
n0
y(n 0 ) = k=-o and hence depends only on values of x(k) for k < n0 If h(n) is not zero for n < 0, then an example of an input for which the output anticipates the input is, of course, a unit sample. (b) Alternatively, consider the convolution sum
+00
x(k) h(n0
k)
y(n) =
k=-o
x(k) h(n -
k)
or, y(n) =
00
x(k) h(n
k)
x(k) h(n
k)
k=-00
k=n+l S3.1
If h(n) is not zero for n < 0 then at least one of the terms in the
+00
summation k=n+l
|y(n)I
|g(n)| |x(n)I
For n > 0,
6(-l) = 1
6(0)
= 1
=
h(l)
6(2) n > 1
6 (1)
= h(n) 2( )n
1)]
S3.2
(b)
y(n)
CO
1)]ejw(n-k)
ejon
1k
-jwk
k e-jwk
k=0 1+ 1e- w
2 2
k=l
=e
jon
-joW
(c)
|H(eW )I
ejo(w), the
IH(e 2)
cos(-n + '
O(')) 2
Tr
H(el2)j O(r)
= -2
1
tan 1 1
Solution 3.5*
(a) If x(n)
-
an u(n).
If
x(n) = 6(n
The system is not linear, as can be demonstrated in a variety of ways. For example, a linear system has the property that T[a x(n)]= aT[x(n)] . Therefore if the input is doubled (for example) the output must double at each value of n, which for this system
cannot happen at n = 0.
S3.3
Solution 3.6*
The system excitation is x(n) = en. the excitation becomes e j(w+ 2 )n
jwn
This means, in essence that in considering complex exponential inputs, a variation in o over a range of 27 generates all of the distinguishable discrete-time complex exponentials. When w varies outside that range we simply see For the system described in this problem, Thus since the same ones over again.
lwn
and
ej(o+27)n are identical input signals their outputs must be identical, and consequently the output parameter P will be periodic with period 27.
S3.4
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.