Selfstudys Com File-9
Selfstudys Com File-9
Directions for questions 1 to 25: Select the correct alterna- (A) |a| > 1
tive from the given choices. (B) |b| < 1
(C) |a| |b| < 1
1. A system is formed by cascading two impulse responses
(D) For all values of a and b system is stable
h1(t) and h2(t) given as
h1(t) = e–3t u(t) 6. A discrete sequence is given as
h2(t) = 2e–5t u(t) x[n] = {–3, –3, –2, 2}
The overall system impulse response h(t) and overall ↑
system is ___________ the auto-correlation rZZ[n] is –
(A) (e–3t + e–5t) u(t) and BIBO stable (A) {–6, 0, 11, 26, 11, 0, –6}
(B) (e–3t – 2e–5t) u(t) and BIBO stable ↑
(C) [e–3t – e–5t) u(t) and BIBO stable (B) {–6, 0, 11, 26, 11, 0, –6}
(D) 2[e–3t – e–5t) u(t) and BIBO unstable ↑
(C) {–6, –1, 0, 22, 11, 0, –6}
2. Two signals ↑
x1[n] = {1, 2, 5} (D) {–3, –3, –2, 2, 2, –2, –3, –3}
x2[n] = {1, 1, 1, 1, 1, 1} ↑
Convolution y[n] = x1[n] ⊗ x2[n] is
7. The impulse response of a system is given by –
(A) {1, 3, 8, 8, 8, 7, 5} (B) {1, 2, 5} n n
(C) {1, 3, 8, 8, 8, 8, 7, 5} (D) None of the above −1 −1
h[n] = 5 u [ n] − 3 u [ n]
3 4
3. The convolution (x[n] + 5 d[n – 5]) ⊗ d [n – 5] can be
simplified to – For this system two statements are
(A) x[n – 5] + 5d [n – 5] (B) x[n] + 5d [n – 5] (1) System is causal and stable
(C) x[n – 5] + 5d [n – 10] (D) x[n – 5] (2) Inverse system is causal and stable
(A) 1 is true (B) 2 is true
4. Which of the following system with impulse response
(C) Both are true (D) Both are false
h[n] is memory less?
h[n] 8. Number of calculation reduced in radix – 2 FFT in
comparison to N-point DFT is –
3 N
(A) N log2 N complex addition and log2 N
2
(B) N(N – 1) complex addition and N2 complex
(A) multiplication.
–6 –5 –4 –3 –2 –1 0 1 2 3 4 5 6 7 n N
h[n]
(C) N complex addition and complex
2
multiplication.
2 (D) None of these
1 9. In decimation in time algorithm for Radix – 2 FFT, the
N-point DFT can be realized from
(B) N
–3 –2 –1 0 1 2 3 4 5 n (A) One number of point DFT.
2
h[n]
N
(B) Two number of point DFTs.
3 2
(C) One number of N-point DFT.
2
(D) Two number of N-point DFTs.
(C) 10. Circular convolution of two sequence
0 1 2 3 4 5 n x1[n] = {2, 3, 1, 1}
(D) None of the above ↑
x2[n] = {1, 3, 1, 2}
5. A system with impulse response h[n] = an bn u[n] is ↑
stable if is
3.74 | Signals and Systems Test 4
(A) [14, 13, 12, 11] (B) [11, 12, 13, 14] Y(ejΩ)
↑ ↑
(C) [13, 14, 11, 12] (D) [12, 14, 11, 12]
↑ ↑ 1
(C) {1, 0.5, 1, 0.5} (b) x(t) = 1 + cos 3πt + sin 5πt (ii) DTFT
(D) {1, 1.5, 1.5, 0} (c) x(t) = e–2t cos 4πt u(t) (iii) FT
13. The Zero-phase DTFT of a sequence x[n] is shown in +∞
figure below – (d) x[n] = ∑ d n − 20m − 2d n − 3 − 20m
m =−∞
(iv) DTFS
X(ejΩ)
(A) a – (ii), b – (i), (c) – (iii), d – (iv)
(B) a – (iv), b – (i), (c) – (ii), d – (iii)
(C) a – (i), b – (ii), (c) – (iii), d – (iv)
(D) a – (ii), b – (iii), (c) – (iv), d – (i)
π 0 π Ω 15. A continuous-time ideal band pass filter whose fre-
4 4 quency response is
Which one of the following is the DTFT of the se- 1, 2wc ≤ w ≤ 4wc
H(jw) =
0, Otherwise
p
− jn
quence y[n] = x[n] e 4
?
If h(t) is impulse response of this filter then the function
Y(ejΩ) g(t) is __________
sin wc t
1
If h(t) = g (t )
pt
(A) 2 cos 2 wc t (B) 2 cos 3 wc t
(A) cos 3 wc t
0 π π
Ω
(C) 2 cos wc t (D)
4 2 2
Y(ejΩ) 16. If the group delay of a discrete time LTI system with
frequency response H(ejω) and real impulse response is
given as
p jp
t = 2 & H e 2 = 2 . Then the input of the
2
(B) p 3p
–π –π 0 Ω system, if output is 2 cos n − is ______
2 4 2 4
Signals and Systems Test 4 | 3.75
(A)
( S − 3) (B)
( S − 3)
X1(t) ( S + 2)( S −1) S ( S + 3)( S − 1)
2
δ(t)
(C)
( S − 3) (D) None of these
1, t > 0
(C) x(t)=Sgn(t)= (iii) b S ( S + 3)( S + 2)
−1, t < 0
o t
24. The 4-point DFT of causal three sample sequence is
δ(t – b) 1
; 0≤ n≤ 2
(A) (a) – (iii), b – (i), (c) – (ii)
given by – x [ n ] = 3
0; else
(B) (a) – (ii), b – (ii), (c) – (i)
(C) (a) – (iii), b – (ii), (c) – (i)
(D) (a) – (i), b – (ii), (c) – (iii) (A) { j −j 1
3
,1, ,
3 3 } (B) {
1,
−j 1 j
, ,
3 3 3 }
{ } { }
19. (i) y[n] = x2[n]
−j j +j −j
(ii) y[n] = log{|x|n|} (C) 1, , − 1, (D) 1, , + 1,
(iii) y[n] = Sin {x[n]} 3 3 3 3
(iv) y[n] = x[n] + x[n – 1] 25. If X[k] is the 4-points DFT of a sequence x[n], then the
Invertible DT system is – DFT of the sequence y[n] = x[n] cos 2πn is –
(A) (i) and (ii) only (B) (ii) and (iv) only 1
(C) (iii) only (D) (iv) only (A) [X(k + 2) – X(k – 2)]
2
20. A discrete time system with output y[n] and input x[n] 1
is given. Causal System is ______ (B) [X(k – 1) + X(k + 1)]
(A) y[n] = 3n+2 x[n] (B) y[n] = 3n x[n + 1] 2
(C) y[n] = 3n x[n] (D) Both A and C 1
(C) [X(k – 1) – X(k + 1)]
21. A Discrete time system is described by – 2
5 x [ 2n] x < 0 1
y [ n] = (D) [X(k – 2) + X(k + 2)]
x≥ 0 2
0
3.76 | Signals and Systems Test 4
Answer Keys
1. C 2. C 3. C 4. D 5. C 6. B 7. C 8. A 9. B 10. D
11. D 12. B 13. B 14. A 15. B 16. A 17. C 18. A 19. D 20. D
21. D 22. D 23. C 24. B 25. B
1
H(ω) = H1(ω) H2(ω) =
1− a b
2
=
( jw + 5)( jw + 3) The R.H.S converges if 1 – |a| |b| > 0
|a| |b| < 1 Choice (C)
1 1
H(ω) = − 6. Auto-correlation is given by –
jw + 3 jw + 5 rxx[n] = x[n] ⊛ x[–n]
h(t) = [e–3t – e–5t] u(t) x[n] = {–3, –3, –2, 2}
For BIBO stability ↑
+∞ ∞ x[–n] = {2, –2, –3, –3}
∫ h (t ) dt = ∫ (e −3t − e −5t ) d t ↑
−∞ 0 the convolution table is shown below –
∞ ∞
→
= ∫ e −3t d t − ∫ e −5t d t x(n)
–3 –3 –2 2
0 0 ↓ x(–n)
1 1 2 –6 –6 –4 4
2
= − = <∞
3 5 15 –2 6 6 4 –4
Thus the system is BIBO stable. Choice (C) 9 9 –6
–3 6
2.
X2[n] –3 9 9 6 –6
X1[n] 1 1 1 1 1 1
1 1 1 1 1 1 1
2 2 2 2 2 2 2 rxx [n] = {–6, 0, 11, 26, 11, 0, –6} Choice (B)
5 5 5 5 5 5 5 ↑
5 3
y[n] = {1, (2 + 1), (5 + 2 + 1), (5 + 2 + 1), (5 + 2 + 1), 7. H(z) = −
1 −1 1 −1
(5 + 2 + 1, (5 + 2), 5} 1+ Z 1+ Z
3 4
= {1, 3, 8, 8, 8, 8, 7, 5} Choice (C)
5 −1 −1 1
3. From the distribution property of convolution we can 5+ Z −3− Z 2 − Z −1
= 4 = 4 .
write –
1 −1 1 −1 1 −1 1 −1
(x[n] + 5 d [n – 5]) ⊛d [n – 5] 1 + Z 1 + Z 1 + Z 1 + Z
3 4 3 4
= x[n] ⊛d [n – 5] + 5 d [n – 5] ⊛d [n – 5]
= x[n – 5] + 5 d [n – 10] Choice (C) Both the poles of this system are inside |Z| = 1.
So the system is stable and causal.
4. For a memory less system
For the inverse system also all the poles are inside
h[n] = 0 for n ≠ 0
|Z| = 1. So inverse system is also stable and causal.
But for all impulse responses given here
Choice (C)
h[n] ≠ 0 for n ≠ 0 Choice (D)
8. In Radix – 2 FFT= with m stages and each stage having
5. For stable system impulse response should be N
+∞ butterflies and each butterfly involve one complex
∑ h [ n] < ∞ 2
n =−∞ multiplication and tow complex additions.
Signals and Systems Test 4 | 3.77
N 9
3 3
So the number of computations in each stage are
2
complex multiplication and N complex addition. So 1 x2[n] 2 1 x2[1–n] 1 = 1 x1[n] x2[1–n] 2 = 14
N N
× m or log 2 N complex multiplication and N
2 2 1 2
2
log2N complex additions. Choice (A)
9. N-point DFT in DIT can be realized from two numbers x3(2) = x1[n] x2[2 – n]
N 3
of point DFTs. 3 1
2
N
The point DFT can be realized from two umbers of 1 X1[n] 2 3 X2[2–n] 2= 3 X1[n] X2[2–n] 4 = 11
2
N
point DFTs and so on. Choice (B) 1 1
4 1
10. x3(3) = x1[n] x2[3 – n]
X1(1) = 3
6
3 2
1 3
X1(3) = 1
3
X2(1) = 1
x3[n] = [12, 14, 11, 12] Choice (D)
↑
X2(2) = 2 X2[n] X2(0) = 3 11. y[n] = x[n] + x[n – 3] + x[n – 5]
By taking DTFT –
Y (e jΩ ) = X (e jΩ ) + e −3 jΩ X (e jΩ ) + e −5 jΩ X (e jΩ )
X2(3) = 1
= (1 + e −3 jΩ + e −5 jΩ ) X (e jΩ )
1
Y (e j Ω )
H (e j Ω ) = = (1 + e −3 jΩ + e −5 jΩ )
2 X2[–n] 3
X (e j Ω )
= e −4 jΩ (e 4 jΩ + e jΩ + e − jΩ )
1 = e −4 jΩ (e 4 jΩ + 2 cos Ω )
Now when = 1 + 2cos Ω e
−4 j Ω
Choice (D)
x3(0) = x1[n] x2[–n] =
12. XDFT{k} = {4, –j, 0, j}
3 1
here N = 4, so
j 2 np k
1 N −1
1 X2[n] 2 2 X2[–n] 3 x[n] = ∑ X DFT [ k ] e 4
N k =0
j 2 np k
1 1 1 3
x [ n] = ∑
4 k =0
X DFT [ k ] e 4
3
1 3
at n = 0, x[0] = ∑ X DFT [ k ] eo
4 k =0
2 X1[n] x2[–n] 6 = 12
1
=
4 [4 – j + 0 + j] = 1
1 1 3 jp j 3p
x3(1) = x1[n] x2[1 – n]
at n = 1, x[1] = ∑ 4 − je + 0 + je
4 k =0
2 2
3.78 | Signals and Systems Test 4
= p(t) e c + e c
3 jw t − j 3w t
1 j 3p
j 9p
= 4 − je + 0 + je = 0.52 2 sin wc t 3 jwc t −3 jwc t sin wc t
4 =
pt
e +e =
pt
(2 cos 3wc t )
x[n] = {1, 1.5, 1, 0.5] Choice (B)
Choice (B)
13. As we know that by frequency shifting property –
−d
16. Group delay t (w ) =
DTFT
e j Ωo n x [ n ] ↔ X e ( o )
j Ω−Ω
∠H(ejw)
dw
− jn
p
j Ω + p So ∠H(ejw) = − ∫ t (w ) d w
So e 4
x [ n] = X e 4
jp 2w p
∠H e 2 = =
So Y (e ) will be the frequency advance version of w w
jΩ
p jp p
X (e jΩ ) by ∠H e 2 = –2 × = – π
4 2
So, Y (e ) will be
jΩ
jp
and H e 2 = 2
Y(ejΩ)
So Y(ejω) = H(ejω) X(ejω)
Y (e j w ) Y (e j w )
X(e ) =
jω =
H (e jw ) | H ((e jw ) | e j∠H (e )
jw
∧ ∧ 0 Ω p p − j 3p
2p d w − + d w + e 4
2 4 2 2
= − jp
Choice (B) 2e
+ j p4
n
1 p p
14. (a) x[n] = u ( n) = p d w − + d w + e
3 2 2
It is a discrete signal and non-periodic signal. So p n p
discrete time fourier transform will be the appro- So x(t) = cos + Choice (A)
2 4
priate Fourier Transform. (a) – (ii)
(b) x(t) = 1 + Cos3πt + Sin5πt 17. Since h[n] = 0 for n < 0, So system is causal
+∞ +∞
It is a continuous time signal and periodic also. So
Fourier Series will be appropriate representation. ∑
k =−∞
h[k ] = ∑
k =−∞
b k u [ n]
(b) – (i) ∞
1
(c) x(t) = e–2t Cos4πt u(t) =∑ b =
k
|β| < 1
It is continuous time signal and non-periodic k =0 1− b
also. So, Fourier Transform will be appropriate Therefore, the system is BIBO stable if β < 1 and un-
representation. stable if |β| ≥ 1. Choice (C)
(c) – (iii)
+∞ 18. Signal
(d) x[n] = ∑ d n − 20m − 2d n − 3 − 20m
m =−∞
(A) x(t) = u(t) – u(t – b)
Signals and Systems Test 4 | 3.79
↔ X ( K − Ko )N
DFT
When k = 3; X(3) x [ n] e N
3p 3p here Ko =1 N = 1
1 + Cos − j Sin −
1
↔ X ( K − 1) N
DFT
= 2 2 j 2 pn
x[n] e
3 3p
j Sin + Cos 3p − j Sin 3p
↔ X ( K + 1) N
DFT
2 x[n] e
− j 2 pn
1 j
= 1 + 0 + j − 1 − j 0 = DFT of y[n]
3 3
1
X[k] = 1,{ −j 1 j
, ,
3 3 3 } Choice (B)
Y(k) =
2
[X(k – 1) + X(k + 1)]
Choice (B)