Code No: 126VK

R15
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
B. Tech III Year II Semester Examinations, April - 2018
DIGITAL SIGNAL PROCESSING
(Common to ECE, EIE)
Time: 3 hours Max. Marks: 75
us
Note: This question paper contains two parts A and B.
Part A is compulsory which carries 25 marks. Answer all questions in Part A. Part B
consists of 5 Units. Answer any one full question from each unit. Each question carries
ed
10 marks and may have a, b, c as sub questions.

PART- A
(25 Marks)
pa
1.a) Show that δ(n) = u(n) – u(n-1) [2]
2
b) Find the Z-transform 𝑓 𝑛 = 𝑛 𝑢(𝑛) [3]
c) State and prove the any three properties of DFT. [2]
pe
d) What is the basic operation of DIF algorithm? [3]
e) What are the properties of Butterworth Low pass filter? [2]
f) Discuss the stability of the impulse invariant mapping technique [3]
r2
g) Explain the effects of truncating an infinite Fourier series into a finite series. [2]
h) What is the condition for the impulse response of FIR filter to satisfy for constant
group and phase delay and for constant group delay? [3]
i) What is the need for Multirate Digital Signal Processing [2]
0-
j) What do you mean by quantization step size? [3]

PART-B
04
(50 Marks)

2.a) An LTI system is characterized by an impulse response

-2
3 𝑛
𝑕 𝑛 = 𝑢(𝑛)
4
01
Find the step response of the system. Also, evaluate the output of the system at n=±5.
b) Consider a discrete-time system characterized by the following input-output
relationship 𝑦 𝑛 = 𝑥 𝑛 − 2 − 2𝑥(𝑛 − 17). Determine whether the system is memory
8
less, time-Invariant, linear, causal and stable. [5+5]
OR
3.a) Given the difference equation 𝑦 𝑛 + 𝑏 2 𝑦 𝑛 − 2 = 0 for 𝑛 ≥ 0 and 𝑏 < 1. With
initial conditions 𝑦𝑓 −1 = 0 𝑎𝑛𝑑 𝑦 −2 = −1, Show that
y n  b n2  n 
cos  
 2 
b) Find the Z-transform of the sequence f(n) defined below: [5+5]

 3n n0

 1
n
f  n     n  0, 2, 4.....
 3 
 1  n
  n  1,3,5....
 2 
4.a) Find the IDFT of the sequence X(K) given below
X(K) = {1,0,0, j, 0, -j, 0,0}
b) Obtain the 10 point DFT of the sequence 𝑥 𝑛 = 𝛿 𝑛 + 2𝛿(𝑛 − 5). [5+5]
OR
5.a) Find the IDFT of the sequence
X(K) = {20, -5.828-j2.414,0,-0.712-j0.414,0,-0.172+j0.414,0,-5.828+j2.414} using
us
DIT- FFT algorithm.
b) Using FFT and IFFT, determine the output of system if input x(n)={2,2,4} and impulse
response h(n) = {1,1}. [5+5]
ed
6.a) Design a digital low pass filter using Chebyshev filter that meets the following
Specifications: Passband magnitude characteristics that is constant to within
1dB for recurrences below ω = 0.2𝜋 and stopband attenuation of atleast 15dB for
frequencies between ω = 0.3𝜋 and 𝜋. Use bilinear transformation.
pa
b) An analog filter has the following system function. Convert this filter into a digital
filter by using the impulse invariant technique: [5+5]
1
pe
𝐻 𝑠 =
(𝑠 + 0.1)2 + 9
OR
7.a) Using a bilinear transformation, design a Butterworth filter which satisfies the
r2
following conditions:
0.8 ≤ 𝐻(𝑒 𝑗𝜔 ) ≤ 1 0 ≤ 𝜔 ≤ 0.2𝜋
𝐻(𝑒 𝑗𝜔 ) ≤ 0.2 0.6𝜋 ≤ 𝜔 ≤ 𝜋
0-
b) Determine H(z) using impulse invariance method for the following system function:
[5+5]
1
𝐻𝑎 𝑠 =
04
(𝑠 + 0.5)(𝑠 2 + 0.5𝑠 + 2)

8.a) The desired frequency response of a low pass filter is given

-2
  j 3 3
e  
Hd e   
01
j 4 4
 0 3
  
 4
8
Find H(𝑒 𝑗𝜔 ) for M=7 using a rectangular window
b) Explain the type II frequency sampling method of designing an FIR digital filter. [5+5]
OR
9.a) Design a band pass filter which approximates the ideal filter with cutoff-frequencies at
0.2rad/sec and 0.3rad/sec. The filter order is M=7. Use the Hanning window function
b) Design an ideal band pass filter with a frequency response. [5+5]
  3
1 
Hd e   
j for
4 4

0 otherwise
10.a) Explain the interpolation process for an integer factor I with an example
b) Given the limit cycle behavior 𝑦 𝑛 = 0.7𝑦 𝑛 − 2 + 0.52𝑦 𝑛 − 1 + 𝑥(𝑛). Find the
dead band of the above two systems. [5+5]
OR
us
11.a) The signal 𝑥(𝑛) is defined by
𝐴𝑛 𝑛>0
𝑔 𝑛 =
0 𝑜𝑡𝑕𝑒𝑟𝑤𝑖𝑠𝑒
ed
i) Obtain the decimated signal with a factor of 3
ii) Obtain the interpolated signal with a factor of 3
1
b) Given the system 𝑦 𝑛 = 2 𝑦 𝑛 − 1 + 𝑥 𝑛
1 𝑛
i) Calculate the response to the input 𝑥 𝑛 = 4 𝑢(𝑛) assuming infinite precision
pa
arithmetic.
ii)Calculate the response 𝑦 𝑛 , 0 ≤ 𝑛 ≤ 5 to the same input assuming finite precision
with five bits, one sign bit plus four fractional bits. The quantization is performed by
pe
truncation. Discuss the results. [5+5]
r2
---ooOoo---
0-
04
-2
01
8