0% found this document useful (0 votes)
2 views

16EC5DCDSP (11)

Uploaded by

Harsh Kumar
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)
2 views

16EC5DCDSP (11)

Uploaded by

Harsh Kumar
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

U.S.N.

B. M. S. College of Engineering, Bengaluru - 560019


Autonomous Institute Affiliated to VTU
JAN / FEB - 2021 Semester End Main Examinations
Programme: B.E. Semester : V
Branch : Electronics and Communication Engineering Duration: 3 hrs.
Course Code: 16EC5DCDSP Max Marks: 100
Course: Digital Signal Processing Date: 04.02.2021

Instructions: 1. Answer any FIVE full questions, choosing one full question from each unit.
2. Missing data, if any, may suitably assumed.

UNIT - I

1. a) Find the N-point DFT of the following sequence 06


x(n)=an 0 ≤ n ≤ N-1
=0 otherwise

If x(n) = { 1,2,0,3,-2,4,7,5 } without computing its DFT evaluate the


mportant Note: Completing your answers, compulsorily draw diagonal cross lines on the remaining blank pages.

b) 08
following :
7
<i> X(0) <ii> X(4) <iii> ∑𝑘 =0 |X(k)| 2
Show that X(0) is always real .

c) For x(n) ={1,-1,1,-1 } find y(n) if Y(k) = X((K-2))4 06

OR
Determine the IDFT of X(K) = {4,-2j,0,2j} using matrix method .
Revealing of identification, appeal to evaluator will be treated as malpractice.

2. a) 04

b) Consider the sequence x(n) = 4δ(n) +3δ (n-1)+ 2δ (n-2) + δ (n-3). 08


Compute six point DFT of the sequence x(n). Determine the finite length
sequence y(n) that has six point DFT , Y(K) = W 6 4K X(K)

c) Prove the following properties of DFT 08


<i> Circular time reversal
<ii> Circular frequency shift

UNIT – II

3. a) obtain the circular convolution result using 4 point DFT and IDFT for the 08
below sequences.
x1 (n) = {1,2,3} and x2 (n) ={ 1,2}.

b) Find the output y(n) of a filter whose Impulse response is h(n) = { 1,2,3,4} 08
and the input signal o the filter is x(n) = {1,4,,3,0,7,4,-7,-7,-1,3,4,3 } using
overlap add method [ use 5 point circular convolution]

c) Discuss the direct computation calculations for N-point DFT 04


UNIT – III
4. a) Compare DIT-FFT and DIF-FFT algorithm 04
𝜋
b) Compute the DFT of the sequence x(n) = cos(𝑛 ) , where N = 4 using 06
2
DIF- FFT algorithm.
1 1 1
c) Let x(n)={1, 2 , 4 ,8 }and h(n)={1,1,1,1} compute the DFT of x(n) by 10
DITFFT and h(n) using DIFFFT algorithms. Using the above results
evaluate the circular convolution of x(n) and h(n) using IDITFFT
algorithm.

UNIT - IV

5. a) Design an analog filter with maximally flat response in the passband and 12
an acceptable attenuation of -2dB at 20 rad/sec. The attenuation in the
stopband should be more than 10 dB beyond 30 rad/sec.

b) Obtain the Cascade form realization for the given difference equation and 08
draw the signal flow graph.
y(n) = 0.75y(n-1) –0.125y(n-2) +6 x(n) + 7x(n-1) +x(n-2)

OR
6. a) Obtain the digital filter equivalent of the analog filter shown for below fig. 12
Using (i) Impulse invariant transformation (ii) Bilinear Transformation
Assuming the sampling frequency. Fs=8Fc where Fc is the cut-off
frequency of the filter.

b) Determine Direct form-I and Form-II structure for the filter is given 08
y(n) = 2bcosω o y(n-1) – b2 y(n-2) + x(n) – b cosω o x(n-1)

UNIT - V
7. a) Determine the filter coefficients hd(n)for the desired frequency response of 12
a low pass filter given by
Hd(ejω ) = e-j2ω -π/4 ≤ |ω| ≤ π/4
0 π/4 ≤ |ω| ≤ π
If we define the new filter coefficients by h(n)=hd(n). ω(n)
ω(n) = 1 for 0 ≤ n ≤4
0 otherwise

b) Discuss the frequency sampling technique method of designing FIR filter 08


*****

You might also like