1

DEPARTMENT OF ECE IT1252 DIGITAL SIGNAL PROCESSING PART A ANSWER THE FOLLOWING QUESTIONS: (10*2=20) 1. Draw the basic FFT butterfly diagram. 2. Write DFT pair of equation. 3. Find the DFT of the sequence x (n) = {1, 0, 1, 0}. 4. Write down the expression for location of poles of normalized Butterworth filter? 5. What are the parameters of Chebysheve Filter? 6. Write briefly about overlap add method. 7. Mention any two properties of DFT. 8. Write down the equation of N for Butterworth & chebysheve Filter. 9. Compute IDFT of the sequence PART B ANSWER THE FOLLOWING QUESTIONS: (3*10=30) 11. (a) Determine the system function H(z) of the lowest order Chebysheve digital filter that meets the following specification (i) 1dB attenuation in the pass band 0 0.3. (ii) At least 60 dB attenuation in the stop band 0.35. (OR) (b) State the Shifting & convolution properties of DFT. 12. (a) Draw the butterfly diagram using 8point DIF-FFT for the following sequences. x(n)={1,2,3,4,5,6,7,8} (OR) (b) Derive the key equation of radix-2 DIFFFT algorithm & draw the relevant graph taking computation of an 8 point DFT for your illustration. 13. (a) Design a digital Butterworth filter satisfying the constraints 0.707H (ej) 1.0; 0 /2 j H (e ) 0.2; 3 /4 . With T=1 Sec using Bilinear transformation. (OR) (b) Enumerate the various steps involved in the design of low pass Digital Butterworth IIR Filter.

x(n)={0,1,2,1} 10. Show that the filter with h[n] = {-1, 0, 1} is a linear phase filter.

DEPARTMENT OF ECE ANSWER THE FOLLOWING QUESTIONS: (10*2=20) 12. (a) Compute 8 point DFT of the following sequence x (n) =cos(n/2) Where N=8 using DIT-FFT algorithm. (OR) (b) Calculate the DFT of the sequence x (n) = {1, 2, 3, 4} by matrix method. 13. (a) Design a chebysheve filter with a maximum attenuation of 2.5dB at pass band frequency 20 rad/sec. & stop band attenuation of 30dB at stop band frequency 50 rad/sec. (OR) (b) Find the IDFT of the sequence x(n)={0,0,0,0,1/2,1/2,1/2,1/2} using DIT-FFT algorithm.

1. Write down the twiddle factor for 8 point DFT. 2. What are the two methods used for sectioned convolution? 3. Compute DFT of the sequence x (n) = {4, 3, 2, 1} using DIF_FFT algorithm. 4. What are the advantages of FFT algorithm over direct computation of DFT.? 5. State the condition for digital filter to be causal & stable. 6. Write briefly about overlap save method. 7. List the advantages & disadvantages of IIR filter. 8. Write any two properties of the Z transform. 9. What is the main drawback of Direct I form realization method. 10. What is mean by recursive & no recursive Filter? ANSWER THE FOLLOWING QUESTIONS: (3*10=30)

11. (a) Compute FFT for the x(n)=n+1 where N=8 using the in place radix_2 DIF-FFT algorithm. (OR)

(b) Apply the bilinear transformation Ha(s) =2/S2+1.141S+1. With T=1sec & find H (z).

DEPARTMENT OF ECE ANSWER THE FOLLOWING QUESTIONS: 1. 2. 3. 4. (10*2=20) b. The specification of the desired low pass filter 0.8H () 1.0; 00.2 H () 0.2; 0.32. 3. (a) Compute the convolution DFT using overlap slave & overlap add method x(n)={1,2,-1,2,3,-2,-3,-1,1,1,2,-1 } h(n)={1,2} (OR) (b) Design an analog Butterworth filter that has -2dB pass band attenuation at a frequency of 20 rad/sec and atleast 10dB stop band frequency attenuation at 30 rad/sec.

State Complex DFT property. Define twiddle factor of FFT. Why IIR Filter do not have linear phase? What is the main drawback of impulse invariant mapping? 5. Find out the DFT of the signal x(n)= (n). 6. What is mean by bit reversal & in place computation as applied to FFT? 7. What are the requirements of converting a stable analog filter into a stable digital filter? 8. Distinguish between the frequency response of Chebysheve type -1 & type II Filter. 9. What is the need for prewar ping in IIR Filter? 10. Compute DFT of the given sequence x(n)={0,1,0,1}. PART B ANSWER THE FOLLOWING QUESTIONS: (3*10=30)

1. (a) Explain in detail about properties of the DFT. (OR) (b)Apply the bilinear transformation of Ha(s)=2/(s+1)(s+2). With T=1sec & find H (Z). 2. (a) Draw the butterfly diagram using 8 point DIT-FFT for the following sequence. x(n)={0.5,0.5,0.5,0.5,0,0,0,0}. (OR)