0% found this document useful (0 votes)
36 views3 pages

Digital Signal Processing Exam June 2025

The document is an examination paper for the Fifth Semester B.E./B.Tech. Degree in Digital Signal Processing, scheduled for June/July 2025. It consists of multiple modules with questions covering topics such as signal classification, Z-transform, DFT, FIR filters, and bilinear transformations. Students are required to answer five full questions, selecting one from each module.

Uploaded by

sahanaa1919
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)
36 views3 pages

Digital Signal Processing Exam June 2025

The document is an examination paper for the Fifth Semester B.E./B.Tech. Degree in Digital Signal Processing, scheduled for June/July 2025. It consists of multiple modules with questions covering topics such as signal classification, Z-transform, DFT, FIR filters, and bilinear transformations. Students are required to answer five full questions, selecting one from each module.

Uploaded by

sahanaa1919
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

BEC502

pm
USN

Fifth Semester B.E./[Link]. Degree Examination, June/July 2025

8
Digital Signal Processing

1 :3
Time: 3 hrs. Max. Marks: 100

:2
Note: 1. Answer any FIVE full questions, choosing ONE full question from each module.
2. M : Marks , L: Bloom’s level , C: Course outcomes.

01

J
Module – 1 M L C

-T
Q.1 a. Estimate the signal x[n] in terms of its odd and even components. 4 L2 CO1

5
02

TJ
b. Classify whether each of the following signal is periodic or not. If periodic 6 L2 CO1
determine its fundamental period:
i) x1(n) = cos (2n)
-2ii) x2(n) = sin (3 n)

-
06

TJ
c. Predict whether the given system y[n] = x[n] + nx[n + 1] is 10 L3 CO1
static / dynamic, linear or non linear, time invariant or time variant, causal
4-

or non causal and stable or unstable. Justify your statements.


J-
-2

-T
OR
U

Q.2 a. Distinguish between continuous and discrete signal. Compute the 10 L2 CO1
convolution of two finite sequence x[n] = [-1, 4, 2, 1] and
VT

TJ

h[n] = [1, 2, 3, 5].


m
3p
b. Write a program to perform the following operations on i) signal addition 4 L3 CO1
-

and ii) multiplication.


TJ

TJ
:0

c. Interpret whether each of the following signal is energy or power signal: 6 L3 CO1
34
-

J-
x (n )  1; n 1
i) ii) x(n) = u(n)
TJ

 0 ; otherwise
:

-T
01

Module – 2
J-

Q.3 a. Calculate Z transform and ROC of the sequence x(n) = an u(n). 5 L2 CO2
TJ
25
-T

b. Write a program to compute N-point DFT and plot magnitude and phase 5 L2 CO2
20

J-

spectrum.
TJ

-T
6-

c. Interpret the process of frequency domain sampling and reconstruction of 10 L2 CO2


discrete time signals.
-0

TJ

OR
24

Q.4 a. Describe any 5 properties of Z-transform with respect to ROC. Explain the 10 L2 CO2
periodicity and linearity DFT property.
J-
-T

b. Compute 4-point DFT of the signal x[n] = [0, 1, 2, 3] using matrix method. 4 L2 CO2

c. Develop the equation for DFT of multiplication of 2 sequences. 6 L3 CO2


TJ

1 of 3
J-
-T
TJ
BEC502

pm
Module – 3
Q.5 a. Explain the circular time shift property. 5 L2 CO3

8
b. Calculate the circular convolution using the following sequences 5 L2 CO3

:3
x1[n] = [2, 1, 2, 1] and x2[n] = [1, 2, 3, 4].

1
c. Compute the 8-point DFT of the sequence x[n] = [1, 1, 0, 0, -1, -1, 0, 0] 10 L2 CO3

:2
using DIT-FFT algorithm.

01

J
OR

-T
Q.6 a. Calculate the output y[n] of a filter whose impulse response is 10 L3 CO3

5
h[n] = [3, 2, 1, 1] and the input signal to the filter

02
x[n] = [1, 2, 3, 3, 2, 1, -1, -2, -3, 5, 6, -1, 2, 0, 2, 1]

TJ
using overlap add method. Assuming the length of block as 7.
-2

-
b. An FIR filter has the impulse response of h[n] = [1, 2, 3]. Determine the 10 L3 CO3
06

TJ
response of the input x[n] = [1, 2]. Use DFT and IDFT and verify the result
using direct computation of linear convolution.
4-

J-
Module – 4
-2

Q.7 a. Determine the filter coefficients hd(n) and h(n) frequency response of low 10 L3 CO4
-T
pass FIR filter for the desired frequency response.
U

Hd (e jw )  e  j2 w w  / 4
VT


TJ

0
4
 w  m
3p
using the rectangular window with window length M = 5.
-
TJ

TJ
:0

b. Explain the Gibb’s phenomenon. 4 L2 CO4


34
-

Realize the linear phase FIR filter with the following impulse response and 6
J-
c. L3 CO4
give necessary equations
TJ

-T

1 1 1
01

h ( n )  ( n )  ( n  1)  ( n  2)  ( n  3)  ( n  4)
2 4 2
J-

TJ
25

OR
-T

Q.8 a. Develop a high pass FIR filter using Hamming window with cutoff 10 L3 CO4
20

frequency of 1.2 rad/sec and N = 9.


J-
TJ

b. Construct direct and cascade realization of system function 10 L3 CO4


-T
6-

5
H( z)  1  z 1  2z  2  2z  3
-0

2
TJ
24

Module – 5
Q.9 a. Summarize how the first order analog low pass filter prototype is 5 L2 CO2
J-

transformed into a different types of filter.


-T

b. Discuss the general mapping properties of Bilinear transformation and 5 L2 CO5


show the mapping between the s-plane and z-plane.
TJ

2 of 3
J-
-T
TJ
BEC502

pm
c. Build a second order digital Lowpass Butter worth filter with a cutoff 10 L3 CO5
frequency of 3.4 kHz at a sampling frequency of 8000 Hz. Draw the direct
form – II structure of this filter use bilinear transformation.

8
:3
OR
Q.10 a. Illustrate the following digital systems using direct form – I and direct 10 L3 CO5

1
form – II

:2
3 1 1
y( n )  y( n  1)  y( n  2)  x ( n )  x ( n  1)

01
4 8 2

J
-T
b. The normalized lowpass filter with a cut off frequency of 1 rad/sec is given 10 L3 CO5

5
1

02
as H P (s)  use a given Hp(s) and the BLT to design a corresponding

TJ
s 1
digital IIR lowpass filter with a cut off frequency of 50 Hz and a sampling
-2
rate of 90 Hz.

-
06

TJ
*****
4-

J-
-2

-T
U
VT

TJ

m
3p
-
TJ

TJ
:0
34
-

J-
TJ

-T
01
J-

TJ
25
-T

20

J-
TJ

-T
6-
-0

TJ
24

J-
-T
TJ
J-

3 of 3
-T
TJ

You might also like