Reg no:

KONGUNADU COLLEGE OF ENGINEERING AND TECHNOLOGY

NAMAKKAL- TRICHY MAIN ROAD, THOTTIAM

EX-05b
Rev: 0

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERINGT

TERMINAL EXAMINATION-I
EC 6502 PRINCIPLES OF DIGITAL SIGNAL PROCESSING
V -SEMESTER

Date: 23.07.16

Session : AN

Time: 3 hours

Max Marks: 100

PART A (1402=28 MARKS)

1.

What is meant by radix 2 FFT algorithm?

2. Compute the number of multiplications needed in the FFT computation of DFT of a

32 point sequence.
3. Determine whether x(n)=u(n) is a power signal or an energy signal.
4. Find the DFT of the sequence x(n)={1,1,0,0}.
5. What are the applications of FFT algorithms?
6. What are the differences and similarities between DIF and DIT algorithms?
7. Find DFT of the sequence x(n)={1,2,3,0} using DIF algorithm.
8. What is Butterworth approximation?
9. Define Prewarping.
10. Mention the advantages of cascade realization.
11. What is bilinear transformation?
12. What are the disadvantages of direct form realization?
13. Give the steps in the design of a digital filter from analog filters using Bilinear
transformation.
14. Convert the given analog transfer function H(s)=1/s+a into digital by impulse
invariant method.
PART B (18=8 MARKS)

Reg no:
15. Summarize the difference between overlap-save method and overlap-add method. (8)
PART C (416=64 MARKS)
16. (a) (i) Describe the following properties of DFT. (1) Convolution (2) Time Reversal
(3) Time shift (4) Periodicity
(8)
(ii)Explain Decimation in time FFT (DIT-FFT) algorithm for 8 point DFT
computation.
(8)
Or
(b) Derive the butterfly diagram of 8 point radix-2 DIF FFT algorithm and fully label
it.
17. (a) Compute the eight point DFT of the sequence x(n)={1
1
otherwise

(16)
0n7

by using DIT and DIF algorithms.

(16)
Or

(b) Find the 8 point DFT of the sequence x(n)={0.5,0.5,0.5,0.5,0,0,0,0} using

decimation in time and decimation in frequency radix-2 FFT algorithm.
18. (a) (i) Explain the design procedure for Butterworth analog filter.
(ii)Write the properties of the impulse invariant transformation.
Or
(b) (i) Using impulse invariant technique converts to z-domain at
T = 1sec., H(s) = 1/(s+1)(s+2).

(16)
(10)
(6)

(8)

(ii) Design digital filter with H(s) =

Bilinear transformation method T=1sec.
(8)

using

19. (a) Determine H(Z) for a Butterworth filter satisfying the following specifications:
j
0.8 H(e 1,
for 0
j
for 0.6
H(e 0.2,
Assume T= 1 sec. Apply bilinear transformation method.
(16)
Or
(b) Design a digital Chebyshev filter satisfying the following constraints using
impulse invariant transform. Assume T = 1 sec.
0.9 | H () | 1,
0 0.25;
| H () | 0.24, 0.5 .

Faculty in-charge

(16)

HOD

Reg no:

KONGUNADU COLLEGE OF ENGINEERING AND TECHNOLOGY

NAMAKKAL- TRICHY MAIN ROAD, THOTTIAM

EX-05b
Rev: 0

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERINGT

TERMINAL EXAMINATION-I
EC 6502 PRINCIPLES OF DIGITAL SIGNAL PROCESSING
V -SEMESTER

Date: 23.07.16

Session : AN

Time: 3 hours

Max Marks: 100

PART A (1402=28 MARKS)

1. Calculate DFT of x(n)={1,1,-2,-2}.

2. Differentiate between DIT and DIF.
3. Draw the basic butterfly diagram for Radix 2 DIT FFT.
4. Find the convolution for x(n)={0,1,2,3} and h(n)={2,0,1}.
5. What is FFT? What is its advantage?
6. List any two properties of DFT.
7. How many multiplications and additions are required to compute N-point DFT using
radix-2 FFT?
8. What is Prewarping?
9. What is the advantage of direct form II realization when compared to direct form I
realization?
10. Why do we go for analog approximation to design a digital filter?
11. Compare Butterworth with Chebyshev filters.
12. Give the steps in the design of a digital filter from analog filters.
13. What are the disadvantages of direct form realization?

Reg no:
14. What is bilinear transformation?
PART B (18=8 MARKS)
15. Discuss the steps in the design of IIR filter using bilinear transformation for any one
type of filter.
(8)
PART C (416=64 MARKS)
16. (a) With appropriate diagram describe (1) Overlap-save method (2) Overlap-add
method.

(16)
Or

(b)Explain Decimation in time and Decimation in frequency FFT algorithm for N=8.
(16)
17. (a) Compute the eight point DFT of the sequence x(n)={1
0

for -3 n 3
otherwise

by using DIT FFT algorithms.

(16)
Or

(b) Using DIT FFT compute DFT of x(n)=cos(n/4) 0 n 7.

(16)

18. (a) (i) Obtain the linear phase realization of the system function
H(Z)=1/2+1/3Z-1+Z-2+1/4 Z-3+Z-4+1/5Z-5+1/2 Z-6
(ii) Obtain the cascade form realization of the digital system:
y(n)=3/4y(n-1)-1/8 y(n-2)+1/3 x(n-1)+x(n).
Or
(b) Design a Butterworth digital LPF for the following specifications:
j
0.8 H(e 1, for 0
j
H(e 0.2,for 0.6
Using Impulse Invariant technique. Assume T=1 sec.

(8)
(8)

(16)

19. (a) Determine H(Z) for a Butterworth filter satisfying the following specifications:
j
0.8 H(e 1, for 0/4
j
H(e 0.2,for /2
Assume T=0.1sec. Apply bilinear transformation method.
(16)
Or
(b) Design a digital Chebyshev filter satisfying the following constraints using
bilinear transform. Assume T = 1 sec.
0.707 | H () | 1, 0 0.2;
| H () | 0.1, 0.5 .

Faculty in-charge

(16)

HOD