Scribd
Upload
101 views2 pages

Digital Signal Processing Exam Paper

This document is the question paper for the Computer Science and Engineering Fifth Semester examination on the subject of Digital Signal Processing. It contains 15 multiple choice and numerical answer questions worth a total of 100 marks. The questions cover topics such as impulse signals, discrete Fourier transforms, convolution, Z-transforms, filtering, quantization, and finite word length effects of digital filters.

Uploaded by

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

Digital Signal Processing Exam Paper

This document is the question paper for the Computer Science and Engineering Fifth Semester examination on the subject of Digital Signal Processing. It contains 15 multiple choice and numerical answer questions worth a total of 100 marks. The questions cover topics such as impulse signals, discrete Fourier transforms, convolution, Z-transforms, filtering, quantization, and finite word length effects of digital filters.

Uploaded by

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

*X64259*

Reg. No. :

Question Paper Code : X 64259


B.E./B.Tech. Degree Examinations, November/December 2020
Fifth Semester
Computer Science and Engineering
cs 331– digital signal processing
(Regulations 2001)

Time : Three Hours Maximum : 100 Marks

Answer all questions

Part – A (10×2=20 Marks)


1. What is an Impulse signal ? Represent it.
2. Represent the following signal x(n) = {1, – 2, 3, 1) graphically. Also represent x(n – 2).
3. What would be characteristics of DFT of odd symmetry and even symmetry signals
and give example for both signals.

( 2)
n
4. Find Fourier transform for 1 u(n – 2).
5. List any two properties of Discrete Fourier Transform.
6. Calculate the multiplication reduction factor, α in computing 1024 point DFT,
using in a radix-2 FFT algorithm.
7. What is a bilinear transformation ?
8. Mention any two procedures for digitizing the transfer function of an analog filter.
9. What is Quantization step size ?
10. What are the two types of quantization employed in digital system ?

Part – B (5×16=80 Marks)


11. a) i) Find convolution of {4, 8, 2, 1, 0, 5}, {3, 2, 1, 5, 6} . (8)
↑ ↑
ii) Response of a system is (1, 2, 3, 4). Find impulse response of the system if the
input is {1, 4, 3, 2}. (8)
(OR)
Z2
b) i) Find the inverse ‘Z’ transform for the following signal , when
(Z − 3) (Z + 5)
the signal is right sided. (8)
ii) Check the system whether it is linear, time invariant and stable. The system
is described as y(t) = 9 cosx(t) . (8)
X 64259 *X64259*

12. a) Find the magnitude and phase spectrum of the system given by (8×2=16)
i) Y(n) = 0.5[x(n) + x(n – 1)]
ii) Y(n) = 0.5[x(n) + x(n + 2)].
(OR)

b) Determine the DFT of the sequence given by x(n) = {1, 2, – 1, 2}.

13. a) List the three well known methods of design techniques for FIR filters and
explain any one. (16)
(OR)

b) Explain in detail triangular window method of FIR filter design

 2x −(N − 1) (N − 1)
1 − : for ≤n≤
WT (n) =  N − 1 2 2

0 : otherwise (16)

14. a) i) Apply the bilinear transformation of


2
Ha (s) = with T = 1 sec and find H(z). (8)
(s +1)(s + 2)

ii) The normalized transfer function of an analog filter is given by
1
Ha (sn ) = 2 .
sn +1.414sn +1
Convert the analog filter to a digital filter with a cutoff frequency of 0.4 π
using bilinear transformation. (8)
(OR)

b) i) Enumerate the various steps involved in the design of low pass digital
Butterworth IIR filter. (6)
ii) The specification of the desired low pass filter is
0.8 ≤|H(w)|≤1.0 ; 0 ≤ w ≤ 0.2π
|H(w)|≤ 0.2 ; 0.32π ≤ w ≤ π
Design a Butterworth digital filter using impulse invariant transformation. (10)

15. a) i) What is meant by finite work length effects on digital filters? List them. (8)
ii) Explain fixed point representation of binary numbers. (8)
(OR)
b) i) Draw the statistical model of fixed point product quantization and
explain. (8)
ii) What are limit cycles? Explain its types in detail. (8)
–––––––––––––

You might also like