Reg. No.

JERUSALEM COLLEGE OF ENGINEERING, CHENNAI – 600 100

Academic Year 2018-2019 Even Semester
B.E – Computer Science Engineering
III Year – VI Semester
IT 6502 DIGITAL SIGNAL PROCESSING
Assessment Test-II

Date : 21.02.19
Time : 10.00 am -11.30 am Maximum: 50 marks

1 What is meant by radix 2 FFT? (CO2) (K)

2 Draw the butterfly structure of DIF-FFT algorithm (CO2) (K)

3 Using the definition W= e-i(2π/N) and the Euler identity e±iθ = cosθ±isinθ,
(CO2) (AP)
Compute the value of WN/3 is ?

4 Compute the DFT of x(n) = {0.5,0,0.5,0} . (CO2) (AP)

5 Summarize the advantages of FFT algorithm? (CO2) (C)

PART B (40 Marks)

6(a) Given x(n) = {1,2,0,1} and h(n) = {2,2,1,1} . Circularly convolve x(n) CO2 (AP)
and h(n) using DFT and IDFT computations. (13)

(OR)
(b) In an LTI system the input x(n) ={1,2,-1,2,3,-2,-3,-1,1,1,2,-1} and the
impulse response h(n) ={1,2 }. Find the output y(n)of the system using CO2 (AP)
overlap save method. (13)

(OR)

7 (a) Explain any four properties of DFT CO2 (AP)

i)Parseval’s Theorem
(ii)Multiplication of two sequences (13)
(iii_complex conjugate property CO2 (AN)
(in)Linearity
(OR)
(b) Find the 8 point IDFT of the sequence X(K)={5, 0, 1-j, 0, 1, 0, 1+j, 0}.
Also plot the magnitude spectrum . (13)
CO2 (AN)

8(a) Compute the 8 point DFT of the following sequence using radix 2 Evaluate
the 8-point DFT for the following sequences using DIF-FFT algorithm.
1 0  n  6

x(n)  

0 otherwise
(OR) (14) CO2 (AN)

Compute IDFT of the sequence

X(K)={7, -0.707-j0.707, -j , 0.707-j0.707 , 1 ,0.707+j0.707 , j , -
0.707+j0.707}
using DIT algorithm

************************************************************************