Question Paper Code:: Reg. No.
Question Paper Code:: Reg. No.
Question Paper Code:: Reg. No.
Reg. No. :
( 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 ?
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)
13. a) List the three well known methods of design techniques for FIR filters and
explain any one. (16)
(OR)
2x −(N − 1) (N − 1)
1 − : for ≤n≤
WT (n) = N − 1 2 2
0 : otherwise (16)
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)
–––––––––––––