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

dsp2021 22

Uploaded by

1234ansh11
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)
16 views2 pages

dsp2021 22

Uploaded by

1234ansh11
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

Printed Page: 1 of 2

Subject Code: KEC503


0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

B. Tech.
(SEM V) THEORY EXAMINATION 2021-22
DIGITAL SIGNAL PROCESSING
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.

SECTION A
1. Attempt all questions in brief. 2 x 10 = 20
a. Define the Recursive and Non-Recursive systems.
b. Enlist the Condition for Linear Phase FIR digital filter with 5 Number of
samples.
c. Differentiate Butterworth Low Pass Filter with Chebyshev LPF in terms of
Filter Order.
d. Evaluate the value of C3(x), Chebyshev Polynomial.
e. Demonstrate the term Gibb’s Phenomenon with schematic diagram.
f. Explain the terms Truncation Error & Round off Error with suitable examples.
g. Evaluate the DFT for the sequence [1, 2, 7, 3].
h. Find out the total no of Complex additions and Complex multiplications
required for calculating 8-point Conventional DFT & by using butterfly
structure DIT-FFT.
i. Explain the term Decimation with suitable example.
j. Find the output of the sequence [1 2 3] after up sampling by a factor N=3.

SECTION B
2. Attempt any three of the following: 10 x 3 = 30
a. Realize the given H(z) for using ladder structure.

𝟐 𝟖𝒛 𝟏 𝟔𝒛 𝟐
H(z)= 𝟏 𝟐
𝟏 𝟖𝒛 𝟏𝟐𝒛

b. Design Digital Butterworth filter to satisfy the following constraints using


bilinear transformation method, the sampling Interval is 2 second: assume
missing data if required:
0.52 ≤│H(ejw) │≤ 1 ,0 ≤ w ≤ π/2
jw
│H(e ) │≤ 0.1 ,3π/4 ≤ w ≤ π

c. Explain the concept of the Limit Cycle Oscillations & dead band effect with
suitable example.
d. Calculate the circular convolution using graphical method for
x(n) = [1,2,3,4] and h(n) = [4,3,2,1].
e. Summarize QMF & Explain analytical and synthesis filter bank with aliasing
free filter bank.

SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) Describe the linear phase FIR systems, &For h (n) = [1/2, 1/3, 1/5, 1/3, 1/2]
Realize H(z) of the Linear Phase FIR system for the given impulse response.
(b) Find out the direct form-I & direct form-II realization of a discrete-time system
represented by the transfer function
Printed Page: 2 of 2
Subject Code: KEC503
0Roll No: 0 0 0 0 0 0 0 0 0 0 0 0 0

𝟏𝟑 𝟗 𝟏
y(n) = - y(n-1) - y(n-2) - y(n-3) + x(n) + 4 x(n-1) + 3 x(n-2)
𝟏𝟐 𝟐𝟒 𝟐𝟒

4. Attempt any one part of the following: 10 x 1 = 10


(a) Design Chebyshev Digital LPF filter to satisfy the following constraints using
Impulse Invariant method.
0.9 ≤│H(ejw) │≤ 1 ,0 ≤ w ≤ 0.25π
│H(ejw) │≤ 0.24 ,0.5π ≤ w ≤ π

(b) Design Chebyshev Digital LPF filter to satisfy the following constraints using
Bilinear Transformation method, assume that the sampling time is one second.
0.707 ≤│H(ejw) │≤ 1 ,0 ≤ w ≤ 0.2π
jw
│H(e ) │≤ 0.1,0.5π ≤ w ≤ π

5. Attempt any one part of the following: 10 x 1 = 10


(a) A low Pass filter is to be designed with the following specifications:

𝟐𝒋𝒘
𝒆 , 𝛑/𝟒 𝐰 𝛑/𝟒
𝑯𝒅 𝒆𝒋𝒘
𝟎 , 𝐨𝐭𝐡𝐞𝐫𝐰𝐢𝐬𝐞

Using Rectangular window function, Find the Filter coefficients & Frequency
spectrum of the designed filter.

(b) Design a Filter with

𝟑𝒋𝒘
𝒆 , 𝛑/𝟒 𝐰 𝛑/𝟒
𝑯𝒅 𝒆𝒋𝒘
𝟎 , 𝛑/𝟒 𝐰 𝛑

Using Hamming window with M= 7.

6. Attempt any one part of the following: 10 x 1 = 10


(a) Using DIF FFT find X (k), for x (n) = 2n+1, for N=8.

(b) Derive &solve the DIT FFT algorithm for 8 numbers of samples.

7. Attempt any one part of the following: 10 x 1 = 10


(a) Explain the block diagrammatic presentation of DSP processor, with its
architecture, addressing formats and its commercial usages.
(b) Write a short note on LMS Algorithm.

You might also like