DSP Comp Dec 2004

BE COMP D S P DEC- 2004
By Kiran Talele ( talelesir@yahoo.com )
Q1. State each of the following statement is True OR False. Justify your answer
in 4 or 5 sentences.
(a) Linear phase Filters are always IIR : [4]
(b) For a causal system h [n ] tends to zero, as n tends to infinity, the system is stable. [4]
(c) A stable filter is always causal : [4]
(d) A stable, causal FIR filter has its poles lying anywhere inside the unit circle
in the z plane : [4]
(e) IIR filters have recursive realization always: [4]
Solution :
Q1. (a) Linear phase Filters are always IIR : [4]

ANS : FALSE.
For linear phase filter h[n] must be either Symmetric or Antisymmetric. For symm h[n],
h[n] = h[N–1–m] and for antisymmetric h[n], h[n] = – h[N–1–m]. In case of IIR filter this
condition is not guaranteed as the length of IIR filter is infinite. However in case of FIR filter,
length of FIR filter is finite and so the condition of symmetric h[n] or antisymmetric h[n] can
be easily fulfilled. Therefore linear phase filters are always FIR Filters.
-------------------------------------------------------------------------------------------------------------------------------------
Q1. (b) For a causal system h [n ] tends to zero, as n tends to infinity, the system is stable. [4]
ANS : TRUE.
For causal system the output of the system is given by

y [n] = x [n] ∗ h[n]
∞ ∞
y [n] = ∑ x[m] h[n − m] = ∑ x[m] h [n − m]
−∞ m =0
∞ ∞
For bounded input ie ∑ x [m] < ∞ if ∑ h[n ] < ∞
−∞ n =0
Then output y[n] is also bounded ie ∑ y [n ] < ∞ .s
Therefore system is BIBO stable.
-------------------------------------------------------------------------------------------------------------------
DSP Help Line : 9987030881 www.guideforengineers.com

B E COMP D S P DEC- 2004 2
Q1. (c) A stable filter is always causal : [4]

ANS : FALSE
The condition for stable filter is ROC must include unit circle.
For causal filter, when pole < 1 system is stable.
For Non causal filer with anticausal h[n], when pole > 1 system is stale and
with bothsided h[n] suppose ROC is P2 > z > P1
Then if P1 < 1 and P2 > 1 then system is stable.
eg. i) causal & stable ii) Anticausal & stable iii) Bothsided & stable
Q1. (d) A stable, causal FIR filter has its poles lying anywhere inside the unit circle in
the z plane : [4]
ANS : FALSE
In case of causal FIR Filter, poles are always only at origin.i.e. pole = 0 .
For causal and stable filter all the poles must lie inside the unit circle.
Therefore, FIR filters are always stable filter with poles only at origin.
-------------------------------------------------------------------------------------------------------------------------------------
Q1. (e) IIR filters have recursive realization always: [4]
ANS : TRUE
In case of IIR Filter, poles can be anywhere in the z plane. Due to pole
position, the transfer function H(z) of IIR filter has the form,
b 0 + b1 + ⋅ ⋅ ⋅ ⋅ ⋅ + b m z
H (z) = .
1 + a1 + ⋅ ⋅ ⋅ ⋅ ⋅ + a N z − N
This gives difference equation in the form,
y[n] = b0 x[n] + b1 x [n – 1] + ⋅⋅⋅⋅⋅bm x[n – m] + a1 y [n – 1] + ⋅⋅⋅⋅⋅+ a2 y[n–N]
output of the filter in terms of past output leads to recursive realization
-------------------------------------------------------------------------------------------------------------------
☯ DSP Help Line : 9987030881 www.guideforengineers.com

Q2. (a) x [n] = δ [n] + δ [n-1] – δ [n – 2] + δ [n – 3] + δ [n – 4] + δ [n – 5]

h[n] = – δ [n ] + 2δ [n – 1] – δ [n – 2] Find y[n] using Linear Convolution. [10]
Solution :
x[n] = { 1, 1, –1, 1, 1, 1} Length L = 6
h [n] = – δ [n ] + 2δ [n – 1] – δ [n – 2]
h[n] = { – 1, 2, –1} Length M =3
y[n] = x [n] ∗ h [n], Length N = L + M – 1 = 8
∞
y[n] = ∑ x[m] h [n − m]
m = −∞
∞
(i) n = 0, y [0] = ∑ x[m] h[n − m]
m =0
y [0] = (1) (–1) = –1
∞
(ii) n = 1, y [1] = ∑ x[m] h [1 − m]
m =0
y [1] = (1) (2) + (1) (–1) = 1
∞
(iii) n = 2, y [2] = ∑ x[m] h[2 − m]
m =0
y [2] = (1) (–1) + (1) (2) + (–1) (–1) =2
∞
(iv) n = 3, y(3) = ∑ x[m] h (3 − m)
m =0
y[3]= (1) (–1) + (–1) (2) + (1) (–1) + 0 = – 4
∞
(v) n = 4, y (4) = ∑ x ( m) h (4 − m)
m =0
y[4] = (–1) (–1) + (1) (2) + (1) (–1) = 3
∞
(vi) n = 5 y(5) = ∑ x (m) h (5 − m)
m =0
y[5] = (1) (–1) + (1) (2) + (1) (–1) + 0 = 0
∞
(vii) n = 6, y(6) = ∑ x ( m ) h (6 − m )
m=0
y[6] = (1) (–1) + (1) (2) + 0 = 1
∞
(viii) n = 7 y(7) = ∑ x (m) h (7 − m )
m =0
y[7] = (1) (–1) + 0 = –1
ANS : y[n] = { −1 , 1, 2, – 4, 3, 0, 1, –1 }
↑
--------------------------------------------------------------------------------------------------------------------

Q2. (b) Obtain the plot of Magnitude Response and Phase Response of a filter with
the following impulse response. h(n) = { –1, 2, –2, 1 } [10]
Solution :
h(n) = { –1, 2, –2, 1 }
By ZT,
H(z) = – 1 + 2z–1 – 2z–2 + z–3
Put z = ejw
H (ejw) = –1 + 2e–jw – 2e–j2w + e–j3w
−j w⎡ −j w⎤
3 3 1 1 3
j w j w j w
2 ⎢ −e 2 + 2e 2 −2 e 2 + e 2 ⎥
H (ejw) = e ⎢ ⎥
⎣⎢ ⎦⎥
3
H (ejw) = e
−j w⎡
2
⎢ − 2 j sin ( 32 w )+ 4 j sin ⎛⎜⎝ 12 w ⎞⎟⎠ ⎤⎥
⎣ ⎦
3 π
−j w j ⎡ ⎛3 ⎞ ⎛ 1 ⎞⎤
H ( w ) = e 2 e 2 ⎢ − 2 sin ⎜ w ⎟ + 4 sin ⎜ w ⎟ ⎥
⎣ ⎝2 ⎠ ⎝2 ⎠⎦
⎛π 3 ⎞
j⎜ − w ⎟
⎡ ⎛3 ⎞ ⎛ 1 ⎞⎤
H ( w) = e ⎝ 2 2 ⎠ ⎢− 2 sin ⎜ w ⎟ + 4 sin ⎜ w ⎟⎥
⎣ ⎝2 ⎠ ⎝ 2 ⎠⎦
(i) Magnitude Response H ( w) = (2 ) (2 )

− 2 sin 3 w + 4 sin 1 w
⎛π 3 ⎞
j⎜ − w ⎟
(ii) Phase Response : φ ( w) = e ⎝ 2 2 ⎠
(iii) Phase : φ = π −
3
w
2 2
W Hr(w) φ
0 0 0.5 π
0.1 π – 0.28 0.35 π + π = 1.35 π –2 π = –0.65 π
0.2 π – 0.38 0.2 π + π = 1.2 π –2 π = –0.8 π
0.3 π – 0.16 0.05 π + π = 1.05 π –2 π = –0.95 π
0.4 π 0.45 –0.1 π
0.5 π 1.41 –0.25 π
0.6 π 2.62 –0.4 π
0.7 π 3.87 –0.55 π
0.8 π 4.98 –0.7 π
0.9 π 5.73 –0.85 π
π 6.0 –π

Magnitude Response
| H(w)|
6.0
5.0
4.0
3.0
2.0
1.0
w
0 0.1π 0.2π 0.4π 0.6π 0.8π π
Phase Response
∅
0.8π
0.6π
0.4π
0.2π
0 w
0 0.2π 0.4π 0.6π 0.8π π
–0.2π
–0.4π
–0.6π
–0.8π
z2
Q 3 A causal system has the following transfer function H(z) = ROC |z| >0.4
z 2 − 0 ⋅1z − 0 ⋅12
(a) Plot the POLE-ZERO locations in the z-plane. [5]
(b) Find h[n] by :- [5]
(i) Partial Fraction Expansion (ii) Power Series Expansion
(c) Find the difference equation and find h[n] from the difference equation. [5]
(d) Show Direct form realization and canonic realization. Is there any difference
in two realizations. [5]

Solution : Q 3 (a) To plot the POLE-ZERO locations in the z-plane. [5]
z2 z2
H (z) = =
z 2 − 0 ⋅ 1 z − 0 ⋅ 12 (z − 0 ⋅ 4) (z + 0 ⋅ 3)
Poles : P1 = 0⋅ 4
P2 = 0⋅3
0.3 0.4
Zeros : Z1 = 0
Z2 = 0
2 ZEROS
Q 3 (b) Find h[n] by :- [5]
(i) Partial Fraction Expansion
(ii) Power Series Expansion
Solution 3(b) (i): To find h [n]:
H(z) z
=
z (z − 0 ⋅ 4) (z + 0 ⋅ 3)
By PFE,
H(z) A B
= +
z z − 0⋅4 z + 0⋅3
H ( z)
( z − 0.4) 4
where A = z =
z = 0.4 7
H ( z)
( z + 0.3) 3
B = z =
z = −0.3 7
4⎡ z ⎤ 3⎡ z ⎤
H (z) = + ⎢
7 ⎣ z − 0 ⋅ 4 ⎦ 7 ⎣ z + 0 ⋅ 3 ⎥⎦
⎢ ⎥
By iZT,
4 3
h[n ] = (0 ⋅ 4 ) n u[ n ] + ( − 0 ⋅ 3) n u[ n ] ANS
7 7
--------------------------------------------------------------------------------------------------------------------------------------
Solution : 3 (b) (ii) To find h [n]:
1 + 0 ⋅ 1z −1 + 0 ⋅ 13z −2 + 0 ⋅ 025z −3
z 2 − 0 ⋅ 1 z − 0 ⋅ 12 + ⋅⋅⋅⋅⋅
z2

− z 2 − 0 ⋅ 1z − 0 ⋅ 12
0 ⋅ 1 z + 0 ⋅ 12
− 0 ⋅ 1z − 0 ⋅ 01 − 0 ⋅ 012 z −1
0 ⋅ 13 + 0 ⋅ 12z −1
− 0 ⋅ 13 − 0 ⋅ 13z −1 − 0 ⋅ 0156z −2
0 ⋅ 025z −1 + 0.0156z −2
H (z) = 1 + 0 ⋅ 1z −1 + 0 ⋅ 13z −2 + 0 ⋅ 025z −3 + ⋅ ⋅ ⋅ ⋅
By iZT,
h [n] = {1, 0⋅1, 0⋅13, 0⋅025, ⋅⋅⋅⋅⋅⋅⋅⋅} ANS
-------------------------------------------------------------------------------------------------------------------------------------
Q 3 (c) Find the difference equation and find h[n] from the difference equation. [5]
Solution :
To find difference equation,
1 Y(z)
H (z) = −1 −2
=
1 − 0 ⋅ 1 z − 0 ⋅ 12 z X(z)
Cross Multiply,
Y (z) − 0 ⋅ 1 z −1 Y(z) − 0 ⋅ 12 z −2 Y(z) = x (z)
By iZT,
y [n] – 0⋅1 y[n–1] – 0⋅12 y[n–2] = x[n]
y [n] = 0⋅1 y[n–1] + 0⋅12 y[n–2] + x[n] ANS
To find h [n], Put x(n) = δ(n).

Then y[n] = h[n]
y [n] = 0⋅1 y[n – 1] + 0⋅12 y[n – 2] + δ [n]
i) n = 0, y(0) = 0⋅1 y(–1) + 0⋅12 y(–2) + δ (0)

y[0] = 0 + 0 + 1 = 1
ii) n = 1, y(1) = 0⋅1 y(0) + 0⋅12 y (–1) + δ (1)

y[1] = (0 ⋅1) (1) + 0 + 0 = 0⋅1
iii) n = 2, y(2) = 0⋅1 y(+1) + 0⋅12 y(0) + δ (2)

y[2] = (0⋅1) (0⋅1) + (0⋅12) (1) + 0 = 0⋅13
iv) n = 3, y(3) = 0⋅1 y(2) + 0⋅12 y(1) + δ (3)

y[3] = (0⋅1) (0⋅13) + (0⋅12) (0⋅1) + 0 = 0⋅025
y[n]= h[n] = { 1, 0⋅1, 0⋅13, 0⋅025, ⋅⋅⋅⋅⋅⋅⋅⋅⋅} ANS

-------------------------------------------------------------------------------------------------------------------------------------

Q 3 (d) Show Direct form realization and canonic realization. Is there any difference
in two realizations. [5]
Solution : Direct form-II Realization.
1
H ( z) =
−1
1 − 0 ⋅1 z − 0 ⋅ 12 z − 2
x(n) y(n)
Σ
Z
-1 Canonic Form realization requires
0.1 less no. of delay blocks. No of delay
blocks = order of the filter.
Direct form –II realization is same as
Z
-1
canonic form.Therefore there is no
difference in realization.
0.12
-------------------------------------------------------------------------------------------------------------------------------------
n n
⎛1⎞ ⎛ 1⎞
Q 4 The impulse response of a system is given by, h ( n ) = ⎜ ⎟ u (n) + ⎜ − ⎟ u (n)
⎝2⎠ ⎝ 5⎠
(a) Find H(z) with ROC [4]
(b) Find H(ejw) directly and from Z Transform. [4]
(c) Comment on system as causal, FIR and Stable. [4]
(d) Find the energy of the signal h[n]. [4]
(e) Give a Parallel Realization of the system. [4]
Solution :
Q 4 (a) Find H(z) with ROC [4]

Solution :
n n
Given h(n) = ⎛⎜ ⎞⎟ u (n) + ⎛⎜ − ⎞⎟ u (n)
1 1
⎝2⎠ ⎝ 5⎠
By ZT,
z z z(z + 1 / 5) + z(z − 1 / 2)
H (z) = + =
z − 1/ 2 z + 1/ 5 (z − 1 / 2) (z + 1 / 5)
3
2z 2 − z 1
H ( z) = 10 Roc : z > ANS
( z − 1 / 2) ( z + 1 / 5) 2
-------------------------------------------------------------------------------------------------------------------------------------

Q 4 (b) Find H(ejw) directly and from Z Transform. [4]

Solution :
(i) To find H(ejw) directly
n n
Now, h(n) = ⎛⎜ ⎞⎟ u (n) + ⎛⎜ − ⎞⎟ u (n) = (0 . 5 )n u ( n ) + (− 0 . 2 )n u ( n )
1 1
⎝2⎠ ⎝ 5⎠
By DTFT,
∞
H ( e jw ) = ∑ h[ n ] e − jnw
n= −∞
∞ ∞
H ( e jw ) = ∑ 0 . 5 n e − jnw + ∑ − 0 . 2 n e − jnw
n= 0 n=0
(0 .5 e − jw )n + ∑ (− 0 .2 e − jw )n
∞ ∞
H ( e jw ) = ∑
n= 0 n=0
1 1
H ( e jw ) = +
− jw
1 − 0 .5 e 1 + 0 . 2 e − jw
( 1 + 0 . 2 e − jw ) + (1 − 0 . 5 e − jw )
H ( e jw ) =
(1 − 0 . 5 e − jw ) ( 1 + 0 . 2 e − jw )
2 − 0 . 3 e − jw
H ( e jw ) =
1 − 0 . 3 e − jw − 0 . 1 e − 2 w
2e j2 w − 0 ⋅ 3e jw
H (e jw ) = ANS
e j2 w − 0 ⋅ 3 e jw − 0 ⋅ 1
(ii) To find H(ejw) from Z-Transform
2z 2 − 0 ⋅ 3 z
Now, H ( z ) =
( z − 1 / 2) ( z + 1 / 5)
2z 2 − 0 ⋅ 3 z
H ( z) =
z 2 − 0 ⋅ 3 z − 0 ⋅1
jw
Put z = e
2e j2 w − 0 ⋅ 3e jw
H (e jw ) = ANS
e j2 w − 0 ⋅ 3 e jw − 0 ⋅ 1
-------------------------------------------------------------------------------------------------------------------------------------
Q 4 (c) Comment on system as causal, FIR and Stable. [4]

Solution :
(i) h[n] is causal signal,
Therefore system is causal system.
(ii) Length of h[n] is infinite

Therefore system is IIR System. NOT FIR.

(iii) By BIBO stsability,

∞
1 1 34
∑ h[n ] = 1 − 0 ⋅ 5 + 1 + 0 ⋅ 2 = 12 is finite
−∞
Therefore system is BIBO stable
-------------------------------------------------------------------------------------------------------------------------------------
Q 4 (d) Find the energy of the signal h[n]. [4]

Solution :
To find energy of h [n]:
2
∞ ∞ n n
⎛1⎞ ⎛ −1⎞
E = ∑ h[n ] ∑
2
= ⎜ ⎟ u[n ] + ⎜ ⎟ u[n ]
−∞ n =0 ⎝2⎠ ⎝ 5 ⎠
∞ ⎡ n ⎤ ∞ ⎡⎛ 1 ⎞ n ⎤ ∞ ⎡ n ⎤
⎛1⎞ ⎛1⎞
= ∑ ⎢ ⎜ ⎟ u[n] +
⎢⎝ 4 ⎠
⎥
⎥
∑ ⎢ ⎜ ⎟ u[n] − 2
⎢ 25
⎥
⎥
∑ ⎢⎜ ⎟ u[n]⎥
⎢⎝ 10 ⎠ ⎥
n =0 ⎣ ⎦ n =0 ⎣⎝ ⎠ ⎦ n =0 ⎣ ⎦
⎡ 1 ⎤ ⎡ 1 ⎤ ⎡ 1 ⎤ 0.1527 ANS
=⎢ ⎥ +⎢ ⎥ −2 ⎢ ⎥=
⎣1 − 1 / 4 ⎦ ⎣1 − 1 / 25 ⎦ ⎣1 − 1 / 10 ⎦
-------------------------------------------------------------------------------------------------------------------------------------
Q 4 (e) Give a Parallel Realization of the system. [4]

Solution :
x[n] y[n]
Parallel Realization :
z z
H (z) = +
z − 1/ 2 z + 1/ 5 Z–1
1 1
H ( z) = +
−1
1 − 0.5 z 1 + 0.2 z −1 0.5
Let H(z) = H1 (z) + H2 (z)

Z–1
– 0.2
-------------------------------------------------------------------------------------------------------------------------------------
Q 5 (A) If x(n) = δ (n) + δ(n –1) + δ (n –2)

(a) Find X(ejw) [3]
(b) Find X[k] 4 point DFT ( Do not use FFT) [3]
(c) Show that DFT is sampled version of X(ejw) [4]
(B) A sequence x[n] = { a, b, c, d } has DFT X[k] = { 1, 2, 3, 4 }. Find x[n] using 4

point DIF-FFT. If y[n] = { a, d, c, b } what is Y[k] ? Use DFT property and
state the property used. [10]

Q 5 (A) (a) Find X(ejw) [3]

Solution :
Given x(n) = δ (n) + δ(n –1) + δ (n –2)
x[n]= {1, 1, 1 }
By ZT, x(z) = 1 + z–1 + z–2
Put z = ejw
X (ejw) = 1 + e–jw + e–j2w ANS
Q 5 (A) (b) Find X[k] 4 point DFT ( Do not use FFT) [3]
Solution :
N −1
By DFT, X[k ] = ∑ x[n ] w nkn where N = 4
n =0
⎡W 0 W N0 W N0 W N0 ⎤ ⎡ x (0) ⎤
⎢ N ⎥ ⎢ x (1) ⎥
⎢W 0 1
W N2 W N3 ⎥
X [o ] = ⎢ N
WN
⎥ ⎢ ⎥
⎢W N0 W N2 W N4 W N6 ⎥ ⎢ x ( 2) ⎥
⎢ 0 ⎥ ⎢ ⎥
⎣⎢W N W N3 W N6 W N9 ⎦⎥ ⎣ x (3) ⎦
⎡1 1 1 ⎤ ⎡1 ⎤
1
⎢1 −j −1 j ⎥⎥ ⎢ 1 ⎥
X[k] = ⎢ ⎢ ⎥
⎢ 1 −1 1 −1 ⎥ ⎢ 1 ⎥
⎢ ⎥
⎣1 j −1 − j ⎦ ⎢ 0 ⎥
⎣ ⎦
⎡ 3 k = 0⎤
⎢− j ⎥
X [k ] = ⎢ ⎥ ANS
⎢ 1 ⎥
⎢ ⎥
⎣ j ⎦
Q 5 (A) (c) Show that DFT is sampled version of X(ejw) [4]

Solution :
From Q5 (A) (a)
X (e jw ) = 1 + e − jw + e − j 2 w
By sampling,
X (k ) = X (e jw ) 2π k
w=
N
( 2πk ) ⎛ 2πk ⎞
−j − j 2⎜ ⎟
X [k ] = 1 + e N +e ⎝ N ⎠

− j 2π
Let 1
WN = e N where N = 4
We get, X[k] = 1 + WNk + WN2k
X [0] = 1 + 1 + 1 = 3
X [1] = 1 + WN1
+ WN2 = 1 + ( j) + (−1) = − j
X [2] = 1 + WN2 + WN4 = 1 + (−1) + (1) = 1
X [3] = 1 + WN3 + WN6 = 1 + ( j) + (−1) = j
⎡ 3 k = 0⎤
⎢− j ⎥
X [k ] = ⎢ ⎥ ANS
⎢ 1 ⎥
⎢ ⎥
⎣ j ⎦
From part (b) and (c), it is proved that DFT is sampled version of X(ejw)
-------------------------------------------------------------------------------------------------------------------
Q 5 (B) A sequence x[n] = { a, b, c, d } has DFT X[k] = { 1, 2, 3, 4 }. Find x[n] using 4
point DIF-FFT. If y[n] = { a, d, c, b } what is Y[k] ? Use DFT property and state
the property used. [10]
Solution :
To find x[n]
Given X [k] = {1, 2, 3, 2}
1
By Inverse FFT, x[n ] = {FFT (X * [k ]} * where N = 4
N
Algorithm :
(i) Find X* [k] :
X*[k] = {1, 2, 3, 2}
(ii) Find FFT of X*[k] using 4 pt DIF. FFT Flowgraph.
X*[0] 1 4 4 8 X*[0]
X* [1] 2 4 4 0 X*[2]
–1
X* [2] 3 -2 -2 -2 X*[1]
–1
X*[3] 2 0 –j 0 -2 X*[3]
–1 –1

(iii) Find x[n]

1
x (n ) = (FFT {X * [k ]}) *
N
*
⎡ 8 ⎤ ⎡ 8 ⎤ ⎡ 2 n = 0⎤
⎢ ⎥
−2 ⎥ ⎢ ⎥ ⎢− 0 ⋅ 5 ⎥
1 1 −2
x (n ) = ⎢ = ⎢ ⎥=⎢ ⎥
4⎢ 0 ⎥ 4⎢ 0 ⎥ ⎢ 0 ⎥
⎢ ⎥ ⎢ ⎥ ⎢ ⎥
⎣ 2 ⎦ ⎣ −2 ⎦ ⎣− 0 ⋅ 5 ⎦
To find Y[k]
If y [n] = {a, d, c, b} = x [–n]

Then By Time Reversal property, of DFT,
Y [k] = X [–k] = X [N –K]s
Y [k] = {1, 2, 3, 2} ANS
-------------------------------------------------------------------------------------------------------------------
jw ⎧⎪ 2 e − j wc 0 ≤ w ≤ wc
Q 6 (A) A low pass filter has the response H (e ) = ⎨
⎪⎩ 0 wc ≤ | w | ≤ π
Find h(n) for transition width < π/32, calculate the window length and the value of α for
(i) Rectangular window (ii) Hamming window. [10]
π / 32 1
Solution : Transition width = =
2π 64
(i) Rectangular window :
Transition width of filter ≥ Transition width of rectangular window.
1 C
≥ where C = 0⋅92 for rectangular window
64 N
∴ N ≥ C × 64
N ≥ 0⋅94 × 64
N −1
N ≥ 58⋅88 Let N = 59 α = = 29
2
(ii) Hamming Window

Transition width of filter ≥ Transition width of Hamming window.
1 C
≥
64 N
N ≥ 64 × C Where C = 3⋅ 14 for hamming window
N −1
N ≥ 200⋅96 Let N = 201 α = = 100
2

To find h[n]
Step-1 Find Hd(w)
⎧⎪ 2 e − j α wc | w| ≤ wc
H (e jw ) = ⎨
⎪⎩ 0 wc ≤ | w | ≤ π
Step-1 Find hd(n) for LPF

π
1
By Inverse DTFT, hd [n] =
2π ∫ H ( w)e jnw dw
−π
wc
(e − j α w )e jnw dw
1
=
2π ∫
− wc
wc
e j ( n −α ) w dw
1
=
2π ∫
− wc
w
1 ⎡ e j ( n −α ) w ⎤ c
= ⎢ ⎥
2π ⎣⎢ (n − α ) j ⎦⎥ − w c
1 ⎡ e j ( n −α ) wc − e − j ( n −α ) wc ⎤
= ⎢ ⎥
π ( n − α ) ⎢⎣ 2j ⎥⎦
w c sin( n − α ) w
h d [n ] = c
π (n − α )w c
where α = 29 for rectangular window.

And α = 100 for Hamming window.
Step-3 Find h[n] using Rectangular window

h[n] = hd[n] w[n] where w[n] = 1 for rectangular window.
⎡ w sin( n − 29 ) w c ⎤
h[ n ] = ⎢ c ⎥ ANS
⎣ π ( n − 29 ) w c ⎦

Step-4 Find h[n] using Hamming window

h[n] = hd[n] w[n]
⎡ ⎛ 2π n ⎞
⎢ 0.54−0.46 cos⎜ ⎟ 0 ≤ n ≤ N −1
Where w[n] = ⎢ ⎝ N −1⎠
⎣⎢ 0 otherwise
for Hamming window function.
⎡ w sin( n − 100 ) w c ⎤ ⎡ ⎛ 2π n ⎞ ⎤
h[ n ] = ⎢ c ⎥ ⎢ 0 .54 − 0 .46 cos ⎜ ⎟ ⎥ ANS
⎣ π ( n − 100 ) w c ⎦ ⎣ ⎝ 200 ⎠ ⎦
-------------------------------------------------------------------------------------------------------------------
Q 6 (B) Design and realize a Low Pass Filter using the Bilinear Transformation
Method to satisfy the following characteristics.
(i) Monotonic Stop Band and Pass Band. (ii) –3dB cutoff frequency of 0.5π
(iii) Stop Band Attenuation of 15 dB at 0.75π [10]
Solution :
Monotonic response means Butterworth filter design.
Ap = 3dB wp = 0.5 π
As = 15 dB ws = 0.75 π
STEP-1 Design Analog Butterworth LPF Filter.
(1) Calculate Ωp Ωs
2 ⎛ wp ⎞ ⎛ 0 ⋅ 5π ⎞
Ωp = tan⎜ ⎟ = 2 tan ⎜ ⎟ = 2 rad /sec
T ⎝ 2 ⎠ ⎝ 2 ⎠
2 ⎛ ws ⎞ ⎛ 0 ⋅ 75π ⎞
Ωs = tan⎜ ⎟ = 2 tan ⎜ ⎟ = 4 ⋅ 828 rad /sec
T ⎝ 2 ⎠ ⎝ 2 ⎠
(2) Calculate filter order N
1
⎡ 10 As / 10 − 1 ⎤ 2
log ⎢ AP / 10 ⎥
⎢⎣10 − 1⎥⎦
N = = 1 ⋅ 93 ≅ 2
LPF ⎡ Ωs ⎤
log ⎢ ⎥
⎣ Ωp ⎦
(3) Calculate Normalized LPF
LPF N = 2 Ωc = 1 rad/sec

⎛ N +1 + 2 k ⎞
jπ ⎜ ⎟
POLES : SK = Ωc e ⎝ 2 N ⎠
⎛ 3+ 2 k ⎞
jπ ⎜ ⎟
⎝ 4 ⎠
SK = e
----------------------------------------
3π
j
k=0, S0 = e 4
3π
−j
k=1, S 1 = e 4
----------------------------------------
1
Now, H ( s ) =
(s − s0 )(s − s1 )
1
H (s) =
⎛ 3π ⎞⎛ 3π ⎞
⎜ j ⎟⎜ −j ⎟
⎜ s − e 4 ⎟⎜ s − e 4 ⎟
⎜ ⎟⎜ ⎟
⎝ ⎠⎝ ⎠
1
Hˆ ( s ) =
s + 2
2 s +1
(4) Calculate Denormalized LPF
Ωp
H(s) = Hˆ ( s ) where Ω c = = 2 rad/sec
(10 − 1)
1
S Ap / 10 2N
S=
Ωc
1
H ( s) =
2
s + 2 s +1 S = S
2
1
H (s) =
2
⎡ s ⎤ ⎡ s ⎤
⎢ 2. ⎥ + 2 ⎢ ⎥ +1
⎣ ⎦ ⎣ 2. ⎦
4
∴ Hˆ ( s ) ==
2
s + 2 2s + 4
STEP – 2 Design Digital Butterworth L P F
By BLT,
H ( z ) = H ( s)
Put T = 1 sec
2 ( z −1)
s=
T ( z +1)

4
H (z) = 2
⎡ 2 ( z − 1) ⎤ ⎡ 2 ( z − 1) ⎤
⎢ ( z + 1) ⎥ + 2 2 ⎢ ⎥+ 4
⎣ ⎦ ⎣ z +1 ⎦
4
H (z) = 2
⎡ 2(z − 1) ⎤ ⎡ 2(z − 1) ⎤
⎢⎣ (z + 1) ⎥⎦ + 2 2 ⎢⎣ z + 1 ⎥⎦ + 4
4 ( z + 1) 2
H (z) =
4 ( z − 1) 2 + 4 2 ( z − 1) (z + 1) + 4 ( z + 1) 2
4( z 2 + 2 z + 1 )
H (z) =
4 ( z 2 − 2 z + 1) + 4 2 ( z 2 − 1) + 4 ( z 2 + 2 z + 1)
( z 2 + 2 z + 1)
H (z) =
( z 2 − 2 z + 1) + 1 . 414 ( z 2 − 1) + ( z 2 + 2 z + 1)
z2 + 2z +1
H (z) =
3 . 414 z 2 − 0 . 586
0 ⋅ 2929+ 0 ⋅ 5858 z −1 + 0 ⋅ 2929 z −2

H ( z) =
1 − 0 ⋅1716 z − 2
Butterworth Filter Realization diagram :
x[n] y[n]
0.2929
–1
z
0.5858
z–1
0.1716 0.2929
------------------------------------------------------------------------------------------------------------------

Q7 (A) Write Note on the applications of DSP in

(a) Image Processing (b) Speech Processing (c) Telecommunication
Solution :

Q7 (B) Explain DSP Processor. State advantages of DSP processor over

microprocessor. [10]
Solution :
A Digital Signal Processor is a special-purpose CPU (Central Processing Unit)

that provides ultra-fast instruction sequences, such as shift and add, and
multiply and add, which are commonly used in math-intensive signal
processing applications.
A TYPICAL DSP SYSTEM :

Digital Signal Processor
Memory
x(t) Data A/D Arithmetic D/A y(t)

acquisition
Unit Converter Unit Converter
DSP
board
Clcok
Digital Signal Processing is a technique that converts signals from real world
sources (usually in analog form) into digital data that can then be analyzed.
Analysis is performed in digital form because once a signal has been reduced
to numbers, its components can be isolated, analyzed and rearranged more
easily than in analog form.
Eventually, when the DSP has finished its work, the digital data can be turned
back into an analog signal, with improved quality. For example, a DSP can
filter noise from a signal, remove interference, amplify frequencies and
suppress others, encrypt information, or analyze a complex waveform into its
spectral components. This process must be handled in real-time - which is
often very quickly. For instance, stereo equipment handles sound signals of up
to 20 kilohertz (20,000 cycles per second), requiring a DSP to perform hundreds
of millions of operations per second.

Advantages of DSP processor over microprocessor.
DSPs are not the same as typical microprocessors. Microprocessors are typically
general-purpose devices that run large blocks of software. They are not often called
upon for real-time computation and they work at a slower pace, choosing a course of
action, then waiting to finish the present job before responding to the next user
command. A DSP, on the other hand, is often used as a type of embedded controller or
processor that is built into another piece of equipment and is dedicated to a single
group of tasks. In this environment, the DSP assists the general-purpose host
microprocessor.
You need to Study.

DSP Comp Dec 2004

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

DSP Comp Dec 2004

Hochgeladen von

Copyright:

Verfügbare Formate

BE COMP D S P DEC- 2004

By Kiran Talele ( talelesir@yahoo.com )

Q1. (a) Linear phase Filters are always IIR : [4]

For causal system the output of the system is given by

DSP Help Line : 9987030881 www.guideforengineers.com

Q1. (c) A stable filter is always causal : [4]

☯ DSP Help Line : 9987030881 www.guideforengineers.com

Q2. (a) x [n] = δ [n] + δ [n-1] – δ [n – 2] + δ [n – 3] + δ [n – 4] + δ [n – 5]

☯ DSP Help Line : 9987030881 www.guideforengineers.com

(i) Magnitude Response H ( w) = (2 ) (2 )

☯ DSP Help Line : 9987030881 www.guideforengineers.com

☯ DSP Help Line : 9987030881 www.guideforengineers.com

Solution : Q 3 (a) To plot the POLE-ZERO locations in the z-plane. [5]

Solution 3(b) (i): To find h [n]:

Solution : 3 (b) (ii) To find h [n]:

☯ DSP Help Line : 9987030881 www.guideforengineers.com

y [n] = 0⋅1 y[n–1] + 0⋅12 y[n–2] + x[n] ANS

To find h [n], Put x(n) = δ(n).

y [n] = 0⋅1 y[n – 1] + 0⋅12 y[n – 2] + δ [n]

i) n = 0, y(0) = 0⋅1 y(–1) + 0⋅12 y(–2) + δ (0)

ii) n = 1, y(1) = 0⋅1 y(0) + 0⋅12 y (–1) + δ (1)

iii) n = 2, y(2) = 0⋅1 y(+1) + 0⋅12 y(0) + δ (2)

iv) n = 3, y(3) = 0⋅1 y(2) + 0⋅12 y(1) + δ (3)

y[n]= h[n] = { 1, 0⋅1, 0⋅13, 0⋅025, ⋅⋅⋅⋅⋅⋅⋅⋅⋅} ANS

☯ DSP Help Line : 9987030881 www.guideforengineers.com

Solution : Direct form-II Realization.

Q 4 (a) Find H(z) with ROC [4]

☯ DSP Help Line : 9987030881 www.guideforengineers.com

Q 4 (b) Find H(ejw) directly and from Z Transform. [4]

(ii) To find H(ejw) from Z-Transform

Q 4 (c) Comment on system as causal, FIR and Stable. [4]

(ii) Length of h[n] is infinite

☯ DSP Help Line : 9987030881 www.guideforengineers.com

(iii) By BIBO stsability,

Q 4 (d) Find the energy of the signal h[n]. [4]

Q 4 (e) Give a Parallel Realization of the system. [4]

Let H(z) = H1 (z) + H2 (z)

Q 5 (A) If x(n) = δ (n) + δ(n –1) + δ (n –2)

(B) A sequence x[n] = { a, b, c, d } has DFT X[k] = { 1, 2, 3, 4 }. Find x[n] using 4

☯ DSP Help Line : 9987030881 www.guideforengineers.com

Q 5 (A) (a) Find X(ejw) [3]

Q 5 (A) (c) Show that DFT is sampled version of X(ejw) [4]

☯ DSP Help Line : 9987030881 www.guideforengineers.com

(ii) Find FFT of X*[k] using 4 pt DIF. FFT Flowgraph.

☯ DSP Help Line : 9987030881 www.guideforengineers.com

(iii) Find x[n]

If y [n] = {a, d, c, b} = x [–n]

(ii) Hamming Window

☯ DSP Help Line : 9987030881 www.guideforengineers.com

Step-1 Find Hd(w)

Step-1 Find hd(n) for LPF

where α = 29 for rectangular window.

Step-3 Find h[n] using Rectangular window

☯ DSP Help Line : 9987030881 www.guideforengineers.com

Step-4 Find h[n] using Hamming window

STEP-1 Design Analog Butterworth LPF Filter.

(3) Calculate Normalized LPF

☯ DSP Help Line : 9987030881 www.guideforengineers.com

(4) Calculate Denormalized LPF

STEP – 2 Design Digital Butterworth L P F

☯ DSP Help Line : 9987030881 www.guideforengineers.com

0 ⋅ 2929+ 0 ⋅ 5858 z −1 + 0 ⋅ 2929 z −2