Scribd
Upload
27 views1 page

DSP Advantages and Properties Overview

The document is an exam for a Digital Signal Processing course covering topics like DSP advantages/disadvantages, linear/time-invariant systems, DFT, FFT algorithms, z-transforms, filter design techniques, decimation/interpolation, and DSP hardware architectures. It contains 8 questions, each with 2 parts, asking students to analyze signals and systems, perform transforms, design filters, and explain DSP concepts and hardware features.

Uploaded by

Mahaboob Subahan
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
27 views1 page

DSP Advantages and Properties Overview

The document is an exam for a Digital Signal Processing course covering topics like DSP advantages/disadvantages, linear/time-invariant systems, DFT, FFT algorithms, z-transforms, filter design techniques, decimation/interpolation, and DSP hardware architectures. It contains 8 questions, each with 2 parts, asking students to analyze signals and systems, perform transforms, design filters, and explain DSP concepts and hardware features.

Uploaded by

Mahaboob Subahan
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

Code: R5320201 R05

[Link] III Year II Semester (R05) Supplementary Examinations June 2014


DIGITAL SIGNAL PROCESSING
(Common to EEE, ECE, EIE & [Link].E)
(for 2006 regular admitted batches only)
Time: 3 hours Max. Marks: 80
Answer any FIVE questions
All questions carry equal marks
*****
1. (a) Discuss the advantages and disadvantages of DSP.
(b) The discrete time system Y (n) = ny (n-1) + x (n), n ≥ 0 is at rest [i.e., y (-1) = 0]. Check if the system
is linear, time invariant and BIBO stable.

2. (a) State and prove any five properties of DFT.


(b) Find the 4-point DFT of x (n) = { 1, -2, 3, 2}

3. (a) Find the DFT of the following discrete time sequence S (n) = {1, -1, -1, -1, 1, 1, 1, -1} using Radix -2
decimation in time (DIT) FFT algorithm.
(b) Give the comparison between DIT and DIF.

4. (a) Using properties of z-transform find the z-transform of the following sequences:
 
(i) x (n) = sin n u(n)



(ii) x (n) = n u(n − 3)


0; n < 0
(iii) x
(n) = 1; 0 ≤ n ≤ 9
0; n > 9
 
(b) The impulse response of a discrete-time LTI system is given by: H (n) = u (n) + − u (n).


(i) Find the z-transform of h (n) and its ROC.


(ii) Is the system causal or non – causal?
(iii) Is the system stable?
(iv) Obtain the difference equation realization of the system.


5. (a) Convert analog filter Ha(s) = ( into digital filter by means of bilinear transformation with T = 1.
)( )
(b) List the properties of the following:
(i) Butterworth filters
(ii) Chebyshev filters – I (type I)
6. (a) What are the advantages of FIR filters over IIR filters?
(b) Design a high pass filter using Hamming window with a cutoff frequency of 1.2 rad/sec and N = 9.

7. (a) Consider a signal x (n) = u (n):


(i) Obtain a signal with a decimation factor 3.
(ii) Obtain a signal with an interpolation factor 3.
(b) Describe the decimation process with a factor of D. Obtain the necessary expression. Sketch
frequency response. Also discuss aliasing effect.

8. (a) Discuss in brief about multiplier and multiplier accumulator (MAC) in DSPs.
(b) Explain the special addressing modes in DSPs.

*****

You might also like