Scribd
Upload
40 views

7Ec2-Digital Signal Processing

1. The document contains questions from a digital signal processing exam covering topics like: converting analog filters to digital filters using impulse invariant and bilinear transformation techniques, designing Butterworth and low-pass filters, computing the DFT and FFT of sequences. 2. Students are asked to determine transfer functions, filter coefficients, and frequency responses for various signal processing systems and filters. 3. One question asks about deriving the DFT of a sequence and computing its amplitude and phase spectrum, or finding the FFT of a sequence.

Uploaded by

abhi_engg06
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
40 views

7Ec2-Digital Signal Processing

1. The document contains questions from a digital signal processing exam covering topics like: converting analog filters to digital filters using impulse invariant and bilinear transformation techniques, designing Butterworth and low-pass filters, computing the DFT and FFT of sequences. 2. Students are asked to determine transfer functions, filter coefficients, and frequency responses for various signal processing systems and filters. 3. One question asks about deriving the DFT of a sequence and computing its amplitude and phase spectrum, or finding the FFT of a sequence.

Uploaded by

abhi_engg06
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

SECOND MID TERM EXAMINATION 2012-13

7EC2- DIGITAL SIGNAL PROCESSING

(BRANCH ELECTONICS & COMMUNICATION ENGG.) Ma . T!"#$ 2 %&'. NOTE$- A))#"*) a++ ,-.& /.#')!-0'. 1.1 (a) Convert a analog filter into digital filter whose system function is H(s) = s + 0.2 . 2 (s + 0.2) + 9
(2.2)

Ma . Ma&('$ 20

Use the im ulse invariant techni!ues. "ssume #= $s (%) Convert the analog filter with system function H(s) = s + 0.$ . (s + 0.$)2 + 9

(2.2)

&nto a digital &&' filter using %ilinear transformation. #he digital filter should have a resonant fre!uency of wr = ( ) *. OR (a) +or the analog transfer function H(s) = $ . (s + $) (s + 2)
(2.2)

,etermine H (-) using im ulse invariant techni!ue. "ssume #= $s. (%) " ly %ilinear transformation to H(s) = /ith # = 0.$. 1.2 (a) ,etermine H(-) for a 0utterworth filter satisfying the following constraints 10.2 3 4 H(e5w) 4 3 $ 4 H(e5w) 4 3 0.2 03 63()2 .( ) * 3 6 3 (
(2.2)

2 . (s + $) (s + .)

(2.2)

/ith #=$s. " ly im ulse invariant transformation. (%) " low ass filter is to %e designed with the following desired a fre!uency res onse. Hd(e5w) = 7 e852w 0 9 9 8( )* 3 6 3 ( )* ( )* 3 6 3 (
(2.2)

,etermine the filter coefficient hd(n) if the window function is defined as w(n) = 7 $ 03 n3* 0 otherwise "lso determine the fre!uency res onse H(eiw) of the designed filter. OR (a) ,esign a digital che%yshev filter to satisfy the constraints

(2.2)

0.:0: 3 4 H(e5w) 4 3 $ 4 H(e5w) 4 3 0.$

0 3 6 3 0.2 ( 0.2 ( 3 6 3 (

Using %ilinear transformation and assuming # = $s. " filter is to %e designed with the following desired a fre!uency res onse. (%) Hd(e5w) = 70 e852w 9 9 8( )* 3 6 3 ( )* ( )* 3 464 3 (
(2.2)

,etermine the filter coefficient hd(n) if the window function is defined as w(n) = 7 $ 03 n3* 0 otherwise "lso determine the fre!uency res onse H(eiw) of the designed filter.

1.3

(a) (%)

,erive the ,+# of the sam le data se!uence ;(n) = 7 $9$92929.9.< and com ute the corres onding am litude and hase s ectrum. =iven ;(n) = 7$929.9*9*9.929$< +ind >(?) using ,&# ++# algorithm.
OR

(2.2)

(2.2)

(2.2)

(a) +ind the *8 oint ,+# of the se!uence ;(n) = cos n ( * (%) =iven ;(n) = 7$929.9*9*9.929$< +ind >(?) using ,&+ ++# algorithm.

(2.2)

1.3

S%-&) 0-)#' -0 (a04 )5-) $. 2. ..

(2.2 2 6 2) @rocessing of s eech signalsA linear redictive coders. @ro erties of ,+# ,ecimation in fre!uency.

You might also like