Scribd
Upload
54 views2 pages

B.Tech (EC, VI SEM) : Ii) All Questions Carry Equal Marks

This document is the question paper for a digital signal processing examination consisting of 5 questions with multiple parts each. It provides instructions for the exam, noting it is 3 hours long and worth a total of 100 marks. The questions cover topics like system functions, filter design methods, windowing techniques, discrete Fourier transforms, and fast Fourier transform algorithms. Students are asked to determine filter structures, design filters to meet specifications, prove properties, compute transforms, and compare computation efficiency.

Uploaded by

Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
54 views2 pages

B.Tech (EC, VI SEM) : Ii) All Questions Carry Equal Marks

This document is the question paper for a digital signal processing examination consisting of 5 questions with multiple parts each. It provides instructions for the exam, noting it is 3 hours long and worth a total of 100 marks. The questions cover topics like system functions, filter design methods, windowing techniques, discrete Fourier transforms, and fast Fourier transform algorithms. Students are asked to determine filter structures, design filters to meet specifications, prove properties, compute transforms, and compare computation efficiency.

Uploaded by

Raj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

EEC-602

Printed Pages-3

Roll
No:

HI-Tech Institute of Engineering and Technology


B.Tech (EC, VI SEM)
Pre University Examination, 2014-2015
Digital Signal Processing
Name of Faculty: Ms. Pankhuri Singh
Time: 3 hours

Total Marks: 100

NOTE: i) Attempt all questions.


ii) All questions carry equal marks.

1. Attempt any two parts of the following

(10 X 2 = 20)

a)

Determine and draw the cascade and parallel realizations for the system
described by the system function:
H(z) = 10 ( 1 (1/2)z -1 ) ( 1 (2/3)z -1 ) ( 1 2z -1)
.
( 1 (3/4)z -1 ) ( 1 (1/8)z -1 ) ( 1 z -1 + (1/2)z -2 )
b) Determine the lattice coefficient corresponding to the FIR filter with system
function,
H(z) = 1 + (13/24)z -1 + (5/8)z -2 + (1/3)z -3 and draw the lattice structure.
c) Draw the direct form structures of the following system function:
H(z) =
1 + 2z -1 + z -2 .
1 0.75z -1 + 0.125z -2
2. Attempt any two parts of the following

(10 X 2 = 20)

a) Design a digital butterworth filter using bilinear transformation method if


0.707 |H(ejw)| 1, 0 |w| 0.5
|H(ejw)| 0.2 , 3/4 |w|

b) Use impulse invariance method to design a digital filter from an analog


prototype that has a system function Ha(s) = (s + a) / ((s + a)2 + b2).
c)

Describe the complete mapping with expressions and diagrams from s-plane
into z-plane if bilinear transformation is used. Explain frequency wraping
effect and prewraping with respect to bilinear transformation. Compare
the impulse invariance method Bilinear transform method of IIR filter
design.

3. Attempt any two parts of the following

(10 X 2 = 20)

Kaiser window is to used to design a linear phase FIR filter that meets
following specification
|H(ejw)| 0.01, 0 |w| 0.25
0.95 |H(ejw)| 1.05 , 0.35 |w| 0.6
|H(ejw)| 0.01, 0.65 |w|
Determine the minimum length (M + 1) of the impulse response and Kaiser
Window parameter .
b) Discuss in detail Rectangular window in FIR filter design. What are the
advantages of windowing method in FIR filter design? How will you select
a window in the design of FIR filter? Explain Gibbs phenomenon.

a)

State and prove the circular convolution property of DFT. Find the
circular convolution of x1(n) and x2(n) for x1(n) = {2 , 1 , 2 , 1} and x2(n) =
{1 , 2 , 3 , 4}.
b) For the sequence x(n) = {2 , 1 , 4 , 6}. Plot
(1) x((n-2))4
(2) x((-n))4
(3) x1(n) if X1(K) = X(K)e-jk
c) Explain relationship between DTFT and DFT. Compute the N- point DT of
each of the following sequences:
(1) x1(n) = (n - no) where 0 no < N
(2) x2(n) = n where 0 n < N

a)

c)

Design an FIR filter to meet the following specifications:


Pass band edge = 2kHz
Stop band edge = 5 kHz
Stop band attenuation = 42 d B
Sampling frequency = Fs = 20 kHz
Use Hanning window.

4. Attempt any two parts of the following

(10 X 2 = 20)

5. Attempt any two parts of the following


a)

(10 X 2 = 20)

Draw the stage wise flow graph for radix-2 decimation in time FFT
algorithm for N = 4. Determine the 4-point DFT of the sequence
x(n) = {1 , 0 , 2 , 1} using decimation in time FFT algorithm.
b) Draw the flow graph of an 8-point decimation in frequency algorithm and
mention different expression. Find 8-point DFT of x(n) = {1,1,1,1,0,0,0,0}.
c) Find inverse DFT of the sequence X(k) = {6 , -2 + 2j , -2 , -2 2j} using
efficient computation algorithm. Compare the number of multiplications
and additions (i.e. computation efficiency) which are needed for direct
computation of DFT with those needed for radix-2 FFT algorithms.

___________________________

You might also like