0% found this document useful (0 votes)
25 views2 pages

Digital Signal Processing

Digital signal processing abstract in clear view format

Uploaded by

thadkarsakshi148
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
0% found this document useful (0 votes)
25 views2 pages

Digital Signal Processing

Digital signal processing abstract in clear view format

Uploaded by

thadkarsakshi148
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
You are on page 1/ 2

B.E. Sixth Semestff (Ele. & Tele.

, Electonics Erginee rg) CNew) (CGS)


11884 : Digital Signal Processing : 6 ET 4

P. Pages : 2 AW - 2940
llllll|l]
ao131* lllllllfllfi Max. Ma*s : 80
Time : Tlree Hours

Noles 1. Due credit will be given to neatness and adequate dimensions.


) Assume suitable data wherever trec€ssary.
3. Illustrate your answq necessary with the help of neat sketches'
4. Use of pen BlueBlack ink/refill only for witing the answer book

l. a) Explain the sigdficance ofimpulse response in discrete-time systems 5

b) Define a signal. Discuss in detail about different types of signals. 8

OR

a) Distinguish belween discrete time signal and digitaj signal. 5

b) Deterni[e whether tliLe following systems are time-invariaDt or time vadant' 8


i) y (n) = x (n) + x (n-1), ii) y(n)=x(-n).
3, a) Find thc inveNc Z-traNform of 6

xtzl
' .4.,],r2 Roc:,zl 'l
(z-t)(z-3)
8
b) Find the z-transform ofthe following sequences,
i) x(n)=nanU(n).
n-l
tu),(")=(1) U(n-l).

OR

7
1. a) Prove that convolution in time domain is equal to muttiplication in Aequeocy domain'

7
h) Determine the system fuDction H(z) and impulse response h(n) ofthe LTI system
described by the difference equalion.
y (n) - x (n) + 3x (n-l) + 2y (n-1) - y (n-2).

6
5, a) Determine the Fourier transform of the signa.l
x(n)= 6 nl;-1. u.1
phase 1
b) Compute the DFT ofthe followirg sequence and also sketch magnitude and
spectrum-
x(n) =[0, l, 2, 3]
OR

P.T.O
AW - 2940 1
,3
6. Derive the decimalion-in-time radix-z FFT algorithm'

6
t. a) ExplaiE the design of FIR filter by fiequency sampling method'

8
b) Realize the following FIR system in direct fotm and cascade form'
H(z) =l+32-t +zz-2
OR

14
ll. Design an ideal high pass filter with a frequency responsc'

n, I"
j" )= t fo, 1< l.als,
4

=o for lwi s I
4
Find the values ofh(n) for N:
1t using Hanniag windor"
Find H (z) and also plot the nagnitude response.

6
I a) What is frequency warping? How it *i11 arisc?

Find the order ofthe Butterworth filter lbr the lbllowing specificalions : 7
b)
dp =3dB , ds =l8dB
fo =lkHz , f"=2KH,
OR

10. a) Compare Butlerworth artd Chebyshev approximations' 6

7
b) Realize the second order system
y(n) = 2r cos(wo)y(n -l) -12 v(n- 2) t x(n) - rcos(w6)x(n -l).
in dircct form - I and direct folm - II.

11. a) Draw and exptain the block diagram ofmultistage decimator' 6

b) Giveo. 7
x(n)=[, 2, 3, 4, 5, 6, 7, 8]

i) Doun sample x (n) bY 2.


ii) Up sample x (n) bY 3.

OR

12, a) What are the different buses of TMS 320C54)O(' DSP processor and tieir fimctions'
6

b) Explain the potyphase decomposition process in detail. 1

AW - 2940 2

You might also like