Scribd
Upload
24 views3 pages

Department of Electrical Engineering National Institute of Technology Srinagar Tutorial III

This document contains a tutorial on digital signal processing. It includes 4 questions on structures for discrete-time systems involving signal flow graphs and network realizations. It also includes 3 questions on the discrete Fourier transform involving computing the DFT of signals and using the DFT and IDFT. Finally, it contains 5 questions on the design of digital filters using techniques like impulse invariance transformation and bi-linear transformation to convert analog filters to digital filters. The tutorial covers topics like direct form realizations, all-pass systems, circular convolution, and designing digital filters to meet specified frequency response specifications.

Uploaded by

Akumar
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
24 views3 pages

Department of Electrical Engineering National Institute of Technology Srinagar Tutorial III

This document contains a tutorial on digital signal processing. It includes 4 questions on structures for discrete-time systems involving signal flow graphs and network realizations. It also includes 3 questions on the discrete Fourier transform involving computing the DFT of signals and using the DFT and IDFT. Finally, it contains 5 questions on the design of digital filters using techniques like impulse invariance transformation and bi-linear transformation to convert analog filters to digital filters. The tutorial covers topics like direct form realizations, all-pass systems, circular convolution, and designing digital filters to meet specified frequency response specifications.

Uploaded by

Akumar
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/ 3

Department of Electrical Engineering

National Institute of Technology Srinagar

Tutorial III

Course Title: Digital Signal processing Semester: Sixth (6th )


Date: 04.06.2019
Course Code: ELE-605

I. Structures for Discrete-time systems

Q.1) Consider the discrete-time linear causal system defined by the difference equation
3 1 1
y[n] − y[n − 1] + y[n − 2] = x[n] + x[n − 1]
4 8 3
Draw a signal flow graph to implement this system in each of the following forms:

1. Direct form I.
2. Direct form II.
3. Cascade.
4. Parallel.

Q.2) In the figure shown below, several networks are shown. Determine the transpose of each and
verify that in each case the original and transpose networks have the same transfer function.

Q.3) In the figure below six digital networks are shown. Determine which one of the last five i.e.,
(b) through (f) has the same transfer function as (a).
Digital Signal Processing Page 2 of 3

z −1 − a
Q.4) The system with transfer function H(z) = is an all-pass system, i.e. the frequency
1 − az −1
response has unity magnitude. Draw a network realization of this system in direct II form and
indicate in particular the number of delay branches required and the number of branches requiring
multiplication by other than +1 or -1.

Student’s name: Please go on to the next page. . .


Digital Signal Processing Page 3 of 3

II. Discrete Fourier Transform


Q.1) Compute the N-point DFT of the following signals:
1. x[n] = 3δ[n]
2. x[n] = 7δ[n − n0 ]
3. x[n] = u[n]
4. x[n] = an
(Note: N point DFT means the signal is made up of N samples only)
Q.2) Given two input signals x1 [n] and x2 [n]. Use 4-point DFT and IDFT to compute the output
y[n] if it is known that y[n] = x1 [n] ∗ x2 [n] .
x1 [n]{1↑ , 2, 3, 1}; x2 [n] = {4 ↑, 3, 2, 2}
Q.3) Compute the circular convolution of the following signals and obtain the circulant matrix:
1. x[n] = n+1 0< n ≤ 3
h[n] = 2δ[n] + 3δ[n − 1] + δ[n − 2]
2. x[n] = {1↑ ,2,3,4} and h[n] = {2↑ , 3, 1}
3. x[n] = {1↑ , 1, −1, 2} ; h[n]= {1↑ , 2, 3, 4}
III. Design of filters
Q.1) Convert the following analogue filters into digital IIR filters using Impulse invariance transformation:
2
1. H(s) =
(s + 1)(s + 3)
s+a
2. H(s) =
(s + a)2 + b2
Q.2) Convert the analog filter into a digital IIR filter for the following system function:
s + 0.1
H(s)=
(s + 0.1)2 + 16
π
Using Bi-linear transformation which is resonant at ωr =
2
Q.3) Determine using BLT method the transfer function and difference equation for the digital
1
equivalent of the RC filter. The normalized transfer function of the RC filter is H(s) = .
s+1
Assume a sampling frequency of 150 Hz and a cut-off frequency of 30 Hz.
Q.4) Design a discrete time filter having the following specifications by applying impulse invariance
to an approximate Butterworth continuous time filter.
Specifications: 0.89 ≤ |H(ω)| ≤ 1 0 ≤ ω ≤ 0.4π
|H(ω)| ≤ 0.18 0.6π ≤ ω ≤ π
Q.5) Design a discrete time filter having the following specifications by applying BLT (bi-linear
transformation) to an approximate Butterworth continuous time filter.
Specifications: 0.8 ≤ |H(ω)| ≤ 1 0 ≤ ω ≤ 0.2π
|H(ω)| ≤ 0.2 0.6π ≤ ω ≤ π

Student’s name: End of exam

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy