Professional Documents
Culture Documents
Discrete Time Systems
Discrete Time Systems
5.2
1. u[ n] + u[ -n] is equal to
x[n]
(A) 2
(B) 1 + d[ n]
(C) 2 + d[ n]
(D) 1
3
2
1
-6
-5
-4
-3
-2
-1
y[n]
1
1
{ u[ n + 3] - u[ n - 4 ] + d[ n]}
2
-6
-5
-4
-3
-2
-1
1
-1
1
{ u[ n] + u[ -n] - u[ n - 4 ] - u[ -n - 4 ]}
2
Fig. P5.2.611
x[n]
A2
(B)
2
A2
(C)
4
3
2
(A)
(D) 0
1
-6
-5
-4
-3
-2
-1
x[n]
3
2
(B)
(D)
-6
-5
-4
-3
-2
-1
(B) 1
1
(C)
2
(D)
x[n]
3
2
(C)
1
-6
-5
-4
-3
-2
-1
y[n]
(D)
question.
-6
www.nodia.co.in
-5
-4
-3
-2
-1
259
Discrete-Time Systems
Chap 5.2
9. x[ 3n - 1]
7. y[1 - n]
y[n]
x[n]
(A)
1
-6
-5
-4
-3
-2
-1
-1
(A)
y[n]
3
-6
-5
-4
-3
-2
-1
1
1
(B)
-6
-5
-4
-3
-2
-1
x[n]
-1
(B)
y[n]
(C)
-6
-5
-4
-3
-2
-1
n
-6
-5
-4
-3
-2
-1
x[n]
(C)
y[n]
-6
-5
-4
-3
-2
-1
(D)
1
-6
-5
-4
-3
-2
-1
-1
-2
x[n]
2
8. x[ n - 2 ] + y[ n + 2 ]
(D)
3
1
-6
-5
-4
-3
-2
-1
(A)
1
-2
-6
-5
-4
-1
-3
10. x[ 3 - n] y[ -n]
-1
x[n]
2
(A)
(B)
2
-6
-5
-4
-3
-2
-1
-6
-5
-4
-3
-2
-1
-1
x[n]
2
(B)
3
2
(C)
-6
-5
-4
-3
-2
-1
-6
-5
-4
-3
-2
-1
1
-6
-5
-4
-3
-2
-1
x[n]
-1
(C)
-1
-2
4
3
x[n]
(D)
-6
1
3
-6
-5
-4
-3
-2
-1
-5
-4
-3
-2
-1
(D)
-1
-1
-2
www.nodia.co.in
Chap 5.2
Discrete-Time Systems
pn
pn
pn p
14. x[ n] = cos
+
- sin
+ 3 cos
3
2
8
4
11. x[ n + 2 ] y[ n - 2 ]
x[n]
(A)
1
-6
-5
-4
-3
-2
-1
-5
-4
-3
-2
-1
j - p
6
15. x[ n] = 2 e
1
-6
x[n]
(B)
260
-5
-4
-3
-2
-1
-1
(C)
-2
-3
-6
-5
-4
-3
-2
-1
(B) 10 rad/cycle
(C) 5 rad/cycle
-1
(D)
which x[ n] is periodic, is
1
rad/cycle
(A)
10
p
rad/cycle
5
-2
-3
(A) -7 n 9
(B) -3 n 9
(C) 2 n 3
(D) -5 n 6
(D)
pn
pn 1
12. x[ n] = cos
+ sin
+
9
2
7
(A) {1, 3, 7, 7, 7, 6, 4}
(B) {1, 3, 3, 7, 7, 6, 4}
(C) {1, 2, 4}
(D) {1, 3, 7}
n
pn
13. x[ n] = cos cos
8
8
(B) {1, 2, 3, 4, 5}
(A) {1, 4, 1}
www.nodia.co.in
261
Discrete-Time Systems
Chap 5.2
(B) {0, 0, 3}
(C) {0, 0, 3, 1, 1, 1, 1}
1,
26. x[ n] = 2,
0
n = -2, 0, 1
n = -1
elsewhere
h (n) = d[ n ] - d[ n - 1] + d[ n - 4]
(A) d[ n ] - 2 d[ n - 1 ] + 4 d[ n - 4 ] + d[ n - 5 ]
(B) d[ n + 2 ] + d[ n + 1 ] - d[ n ] + 2 d[ n - 3 ] + d[ n - 4 ] + d[ n - 5 ]
(C) d[ n + 2 ] - d[ n + 1 ] + d[ n ] + 2 d[ n - 3 ] - d[ n - 4 ] + 2 d[ n - 5 ]
(D) d[ n ] + 2 d[ n - 1 ] + 4 d[ n - 5 ] + d[ n - 5 ]
(A)
4
6
(B)
4
u[ -n + 2 ]
6
(C)
8
( -1) n u[ -n + 2 ]
3
(D)
8
( -1) n
3
28. y[ n] =
1
u[ n] * u[ n + 2 ]
4n
1 1
(A) - n u[ n]
3 4
1 12
(B) - n u[ n + 2 ]
3 4
4 1 1 n
(C) u[ n + 2 ]
3 12 4
1
16
(D)
- n u[ n + 2 ]
3 4
29. y[ n] = 3n u[ -n + 3] * u[ n - 2 ]
3n
,
(A) 2
83 ,
2
3n
,
(C) 2
81 ,
2
n 5
n6
n 5
n6
3n ,
(B) 83
2 ,
3n
,
(D) 6
81 ,
2
30. y[ n] = u[ n + 3] * u[ n - 3]
(A) ( n + 1) u[ n]
(B) nu[ n]
(C) ( n - 1) u[ n]
(D) u[ n]
www.nodia.co.in
n 5
n6
n 5
n6
262
31.
Discrete-Time Systems
The
convolution
of
x[ n] = cos ( 2p n) u[ n]
and
Chap 5.2
n = 4 m + 1, 4 m + 2
n = 4 m, 4 m + 3
x[n]
n = 4 m + 1, 4 m + 2
10
y[n]
Fig. P5.2.37
n = 4 m, 4 m + 3
(A) P, Q, R, S
(B) Q, R, S
1,
(C)
0,
n = 4 m + 1, 4 m + 3
(C) P, R, S
(D) P, Q, S
0,
(D)
1,
n = 4 m + 1, 4 m + 3
n = 4 m, 4 m + 2
n = 4 m, 4 m + 2
38. x[ n] as shown in fig. P5.2.38
x[n]
y[n]
+
Fig. P5.2.38
(A) P, Q, R, S
(B) P, Q, R
(C) P, Q
(D) Q, R, S
and S2
in fig. P5.2.3941.
(B) Q, R, S
(C) R, S, P
(D) S , P, Q
x[n]
S2
S1
y[n]
Fig. P5.2.3941.
33. y[ n] = nx[ n]
(A) P, Q, R, S
(B) Q, R, S
(C) P, R
(D) Q, S
34. y[ n] =
are
n +1
u[ m ]
m = -
(A) P, Q, R, S
(B) R, S
(C) P, Q
(D) Q, R
35. y[ n] = x[ n]
(A) Q, R, S
(B) R, S, P
(C) S, P, Q
(D) P, Q, R
(A) a, b, c
(B) b, c, d
(C) a, c, d
(D) All
Fig. P5.2.36
(A) P, Q, R, S
(B) Q, R, S
(B) Only a
(C) P, Q
(D) R, S
(C) Only b
(D) None
www.nodia.co.in
Chap 5.2
Discrete-Time Systems
263
(B) Only a
(C) Only b
(D) None
y[n]
1
4
x[n]
y[n-2]
1
4
-1
2
Fig. P5.2.45
system :
x1 [ n] = {1, 0, 2}
y1 [ n] = {0, 1, 2}
x2 [ n] = {0, 0, 3}
y2 [ n] = {0, 1, 0, 2}
x3[ n] = {0, 0, 0, 1}
y3[ n] = {1, 2, 1}
1
h[ n] = - u[ n].
2
system is
(A) System is linear
1
1
2 --
3
2
(C)
1
1
2 + -
3
2
n +1
(A)
n +1
u[ n]
u[ n]
u[ n]
(B)
1
1
2 --
3
2
u[ n]
(D)
1
1
2 + -
3
2
system is
x1 [ n] = { -1, 2, 1}
y1 [ n] = {1, 2, - 1, 0, 1}
y[ n] -
x2 [ n] = {1, - 1, - 1}
y2 [ n] = { - 1, 1, 0, 2}
x3[ n] = {0, 1, 1}
y3[ n] = {1, 2, 1}
(A)
3 1
- u[ n]
2 2
(C)
3 1
u[ n]
2 2
(B)
2 1
- u[ n]
3 2
(D)
21
u[ n]
32
y [ -1] = 3
1
y[ n - 1] = 2 x[ n],
2
the system is
(A) System is time-invariant
system is
y[ n] - 2 y[ n - 1] + y[ n - 2 ] = x[ n] - x[ n - 1]
If y[ n] = 0
1
( y[ n - 1] + y[ n - 2 ])
2
(C) y[ n] = x[ n] - (15
. y[ n - 1] + 0.4 y[ n - 2 ])
for n < 0
and x[ n] = d[ n],
then y[2 ]
will be
(A) 2
(B) -2
(C) -1
(D) 0
is specified as
Chap 5.2
Discrete-Time Systems
S : e jpn
e jp3n
264
Solutions
The system is
(A) definitely LTI
(B) definitely not LTI
1. (B)
u[n]
-6
x[ n + 1],
S1 : y[ n] =
x[ n],
n
,
x
S2 : y[ n] = 2
0,
n 0
n -1
-4
-3
-2
-1
1
n
-6
-5
-4
-3
-2
-1
Fig. S5.2.1
S1
5. (C) P = Lim
N
1
v[ n - 1] + x[ n]
2
v[ n] =
S2 : Causal LTI
y[ n] = ay[ n - 1] + bv[ n]
1
3
y[ n] = - y[ n - 2 ] + y[ n - 1] + x[ n]
8
4
1
2N + 1
(D) 2
y[n]
S1 : Causal LTI
(B) 1
Fig. P5.2.5152
(C) 4
-5
n odd
0 1
u[-n]
-1
u[n] + u[-n]
2
(C) 4
-2
n even
(B) S2
-3
n
-6
(A) S1
S2
-4
x[n]
-5
n=N
(u[ n])
(D) 2
**********
N +1 1
=
2N + 1 2
v[0 ] = x[0 ] = 0
v[2 ] = x[ 4 ] = 0
v[ -1] = x[ -2 ] = 1,
v[ -2 ] = x[ -4 ] = 0
So x[ n] = {3, 2, 1, 0, 1, 2, 3}
x[2 n] = {2, 0, 2}
0, 1, 1, 1, 1}
y[ -n + 1] = {1, 1, 1, 1, 0, -1,
(B) 1
n =- N
-1,
-1, -1}
8. (C) x[ n - 2 ] = {3, 2, 1, 0, 1, 2, 3}
x[ n - 2 ] + y[ n + 2 ]
= { -1, -1, -1, -1, 0, 4, 3, 2, 1, 1, 2, 3}
www.nodia.co.in
265
Discrete-Time Systems
Chap 5.2
9. (C) x[ n - 1] = {3, 2, 1, 0, 1, 2, 3}
x[ 3n - 1] = {1, 2}
Fig. S5.2.19
2p
1
=
N
6
-2
-1
-2
-1
-2
-2
-2
-2
-2
Fig. S5.2.21
y[ n] = {0, 0, 1, -1, 2, 2, 1, 3}
22. (A)
N =
p
, Not periodic.
3
2pm
The smallest value of W is attained
N
2p p
rad/cycle.
with m = 1, W =
=
10 5
16. (D) W =
M1 = 2,
-2
-2
-2
-2
-2
Fig S5.2.22
y[ n] = {0, 0, 1, -1, 2, 2, 1, 3}
17. (B) L1 = N1 + M1 , L2 = N 2 + M 2
N1 = -5, N 2 = 3,
-1
N 3 = 8,
-1
21. (D)
14. (A) N1 = 4,
Fig. S5.2.20
y[ n - 2 ] = {-1, - 1, - 1, - 1, 0, 1, 1, 1, 1}
N1 = 18 ,
1
1
M2 = 6
23. (D)
18. (A)
1
-2
-2
-2
-2
-2
-3
-3
-3
-3
-3
Fig. S5.2.18
Fig. S5.2.23
y[ n] = {1, 3, 7, 7, 7, 6, 4}
y[ n] = {1, -1, - 5,
www.nodia.co.in
2,
3, -5,
1,
4}
Chap 5.2
Discrete-Time Systems
266
or
n < - 2, y [ n] = 0
n+2
4k
n - 2, y[ n] =
or
4 1 1
,
3 12 4 n
k=0
for n - 2 4 or n 6, y[ n] =
-3
-6
12
-4
-4
-16
12
-24
-16
12
-9
18
12
k = -
3n
6
k=
Fig. S5.2.24
n -2
4 1 1 n
y[ n] = u[ n + 2 ]
3 12 4
3n
,
y[ n] = 6
81 ,
2
81
,
2
n 5
n6
n < 0,
n > 0, y[ n] =
for n - 3 - 3 or
y[ n] = 0
n -3
1 = n + 1,
k = -3
y[ n] = ( n + 1) u[ n]
31. (A) For n - 1 < 0
For
n -1 0
or
or
Fig. S5.2.25
1,
y[ n] =
0,
n <1 ,
y[ n] = 0
n -1
p
n 1, y[ n] = cos k
k=0
2
n = 4 m + 1, 4 m + 2
n = 4 m, 4 m + 3
y2 [ n] k y1 [ n]
-1
-1
-1
-2
-1
-1
y1 [ n - no ] = rect ( v[ n - no ]) = y2 [ n]
(Causal)
Fig. S5.2.26
y[ n] = {1, 1, -1, 0, 0, 2, 1, 1}
ky1 [ n] = y2 [ n]
y[ n ] = d[ n + 2 ] + d[ n + 1 ] - d[ n ] + 2 d[ n - 3 ] + d[ n - 4 ] + d[ n - 5 ]
( -1)
27. (D) y[ n] =
k=n -2
1
2 -
2
=
1
1+
2
2n -k = 2n
k=n -2
1
-
2
8
( -1) n
3
(Homogeneous)
Let x1 [ n] = v[ n]
then
y1 [ n] = nv[ n]
Let x2 [ n] = w[ n]
then
y2 [ n] = nw[ n]
Let x3[ n] = v[ n] + w[ n]
Then y3[ n] = n( v[ n] + w[ n]) = nv[ n] + nw[ n]
= y1 [ n] + y2 [ n]
n -2
y2 [ n] = nkv[ n]
(Additive)
267
Discrete-Time Systems
(Time variant)
Chap 5.2
(Causal)
(Causal)
(Stable).
34. (C) y1 [ n] =
v[ m ] ,
n +1
y1 [ n] =
n +1
v[ m ],
(Homogeneous)
n +1
w[ m ]
y2 [ n ] =
n = -
y3[ n] =
( v[ n] + w[ m ])
m = -
m = -
(Causal)
v[ m ] + w[ n] = y [ n] + y [ n]
1
(Additive)
(Stable).
also linear
y[ n - 1] = x[ n - 1] + y[ n - 2 ]
y1 [ n] =
n +1
v[ n] ,
y2 [ n ] =
m = -
y1 [ n - no ] =
(Time Invariant)
future excitation.
m = -
y1 [ n - no ] = 10 v[ n - no ] - 5, = y2 [ n]
n +1
n +1
n = -
n +1
y2 [ n] = 10 kv[ n] - 5
y1 [ n] = 10 v[ n] - 5, y2 [ n] = 10 v[ n - no ] - 5
m = -
y2 [ n] = ky1 [ n]
37. (B) y1 [ n] = 10 v[ n] - 5,
y2 [ n] ky1 [ n]
kv[ m ]
y2 [ n ] =
m = -
(Unstable)
n +1
v[ m - n ]
n -no +1
v[ m ]
m = -
y[ n] = x[ n] + x[ n - 1] + y[ n - 2 ], Then by induction
m = -
y[ n] = x[ n - 1] + x[ n - 2 ] + K x[ n - k] + K = x[ n - k]
n +1
v[ q - n ] = y [ n]
o
q = -
k=0
(Time Invariant)
At any discrete time, n = no , the response depends on
y1 [ n] =
without bound.
(Unstable)
y3[ n] =
m = -
m = -
m = -
(v[ m ] + w[ m ]) = v[ m ] + w[ m ]
= y1 [ n] + y2 [ n]
(Additive)
y1 [ n] =
y1 [ n] = v[ n] , y2 [ n] = v[ n - no ]
y1 [ n] can be written as
v[ m ]
y1 [ n - no ] =
v[ n - n ]
, y2 =
m = -
kv[ m ] = ky [ n]
m = -
System is Linear.
(Time Invariant)
m = -
y2 [ n ] =
y1 [ n - no ] = v[ n - no ] = y2 [ n]
m =n
(Homogeneous)
(Anti causal)
If the excitation is a constant, the response increases
v[ m ] ,
m = -
x[ m ] = x[ m ]
Let m = n - k then y[ n] =
n
m = -
n -no
m = -
q = -
v[ m ] = v[ q - n ] = y [ n]
o
(Time Invariant)
(Causal)
(Causal)
36. (B) y[ n] = 2 x 2 [ n]
Let x1 [ n] = v[ n]
without bound.
then y1 [ n] = 2 v 2 [ n]
y2 [ n] = 2 k2 v 2 [ n]
(Unstable)
y1 [ n] = 2 v 2 [ n]
S1 : y[ n] = x[ n] + b ,
S2 : y[ n] = x[ n] - b , where b 0
Let x2 [ n] = v[ n - no ] then y2 [ n] = 2 v 2 [ n - no ]
y1 [ n - no ] = 2 v[ n - no ] = y2 [ n]
Hence S is linear.
(Time invariant)
www.nodia.co.in
Chap 5.2
Discrete-Time Systems
268
For n 0,
S2 : y[ n] = nx[ n + 1]
s[ n] =
1
- 2
k=0
non causal
S2 : y[ n] = x[ n - 2 ]
causal
S : y[ n] = x[ n - 1] which is causal
1
y ( n ) [ n] = C ,
2
1
=0
2
-1
1
y[ -1] = 3 = C ,
2
C=
3
,
2
(false)
S1 : y[ n] = e x [ n ] stable,
S2 : y[ n] = ln ( x[ n]) unstable
But S : y[ n] = x[ n]
1
1
2 + -
3
2
y ( n ) [ n] =
3 1
u[ n]
2 2
stable (false)
x3[ n]
y3[ n] and x2 [ n]
y2 [ n ]
y2 [ n] = {3, 6, 3}
form Ae
jpn 2
. This
y1 [ n] + y2 [ n] = {0, 3, 1, 2, 1}
If the system were time invariant, the response to
v[ n] =
one so stable.
1
a
y[ n] - y[ n - 1],
b
b
1
a
v[ n - 1] = y[ n - 1] - y[ n - 2 ]
b
b
For (B) a12 = -0.25 j0.66. Its magnitude are less than
1
and subtracting
2
v[ n] -
1
1
a
1
a
v[ n - 1 ] = y[ n] - y[ n - 1 ] y[ n - 1 ] +
y[ n - 2]
2
b
b
2b
2b
x[ n] =
4 y [ n] - y [ n - 1] + 2 y [ n - 2 ] = x [ n]
Eigen values are
4 a 2 - a + 2 = 0, a12 = 0.125 j0.696
Its magnitude are less than 1. Thus system is stable.
1
y[ n] = ( x[ n] + y[ n - 1] + 2 y [ n - 2 ])
4
1
1
a
a
y[ n] - +
y[ n - 2 ]
y[ n - 1] =
b
2b
b 2b
1
a
y[ n] = a + y[ n - 1] - y[ n - 2 ] + bx[ n]
2
2
1
Comparing a = , b = 1
4
52. 52. (B) b = 1.
**********
www.nodia.co.in