Guru Nanak Dev Engineering College, Bidar

Course File
Digital signal processing (18EE63) Credit: 4
Hours: 50
CONTENTS
Course Objectives: To
1. Understand the frequency domain sampling and reconstruction of discrete time
signals.
2. Study the properties and the development of efficient algorithms for the computation
of DFT.
3. Realization of FIR and IIR filters in different structural forms.
4. Learn the procedures to design of IIR filters from the analog filters using impulse
invariance and bilinear transformation.
5. Study the different windows used in the design of FIR filters and design appropriate
filters based on the specifications.
6. Understand the architecture and working of DSP processor

Pre-requisites:
Students must have exposure to basics of signals and systems, matrices.

Linkages with other Courses:

1. Signals and systems.
2. DSP algorithms & architecture.
3. Digital Image Processing

Course Policies and Procedures:

(Expectations from students, Rules for Student Assignments, Assignment Grading System, CIE and
Semester End Examinations.)
Expectations from student:
1. Students should attend all classes.
2. Students should remember & follow all the tricks to solve the problems.
3. Students should have calculator in every class.
4. Students should have the knowledge of pre-requisite
5. Students should complete all assignments in a time bound manner
Rules for assignments: At the end of every module, assignments in the form of question answers
will be given and students have submit the same before last date
Assignment Grading System
Each assignment will be evaluated for 10 marks and final score for assignment will be the average
marks scored in all the assignments.( Similarly other assignments like seminar, model making has to
be evaluated using suitable rubrics)
CIE and Semester End Examinations: As per the VTU regulations.

Evaluation Policy ( It is only indicative, may vary from course to course):

Level of Question Approximate % of Question
Understanding 10%
Apply 10%
Analyze / Solve 40%
Design 40%

Lesson Plan
 Module Topics Class Teaching
wise Number Methodology
distribution
of Classes
Overview of course, Course Outcome its linkages with 1 Interactive
other courses and practical applications, expectations Discussion
from students, Evaluation Policy etc.
Module 1: Discrete Fourier Transforms (DFT): 2 Lecture
Definitions, properties
Properties of the DFT: Periodicity, Linearity property 3 Lecture

Properties of the DFT: Periodicity, Linearity property 4 Lecture

Tutorial 5 Lecture

10 6 Audio Visual
Tutorial Aids

Symmetry properties 7 Lecture

Multiplication of two DFTs and Circular 8 Lecture

Convolution
Additional DFT properties. 9 Lecture

Tutorial 10 Lecture

Tutorial 11 Lecture

10 Module 2:- Fast-Fourier-Transform (FFT) algorithms: 12 Lecture

Introduction, decimation in time algorithm
first decomposition, number of computations 13 Lecture

decimation-in-frequency algorithm 14 Lecture

Tutorial 15 Lecture

Tutorial 16 Lecture

continuation of decomposition, 17 Lecture

number of multiplications, computational efficiency, 18 Lecture

decimation in frequency algorithms, Inverse radix – 2 19 Audio Visual

algorithms Aids

Tutorial 20 Lecture

Tutorial 21 Lecture

10 Module 3: Design of FIR Filters: Introduction, impulse 22 Lecture

invariant transformation
bilinear transformations 23 Lecture

All pole analog filters- Butterworth & Chebyshev filters 24 Lecture

Tutorial 25 Lecture
 Tutorial 26 Lecture

design of digital Butterworth filter by impulse invariant 27 Lecture

transformation
bilinear transformation, 28 Audio Visual
Aids

Frequency transformations 29 Lecture

Tutorial 30 Lecture

Tutorial 31 Lecture

10 Module 4: Design of IIR Digital Filters (Continued): 32 Lecture

Design of digital Chebyshev –type 1filter by impulse
invariant transformation and bilinear transformation
bilinear transformation 33 Lecture

Frequency transformations 34 Lecture

Tutorial 35 Lecture

Tutorial 36 Lecture

Realization of IIR digital systems:- direct form 37 Lecture

cascade form and parallel form 38 Lecture

Ladder structures for equal degree polynomial. 39 Audio Visual

Aids

Tutorial 40 Lecture

Tutorial 41 Lecture

10 Module 5: Design of FIR Digital Filters: Introduction, 42 Lecture

windowing, rectangular
modified rectangular 43 Lecture

Hamming, Hanning, Blackman window 44 Lecture

Tutorial 45 Lecture

Tutorial 46 Lecture

design of FIR digital filters by use of windows 47 Lecture

Design of FIR digital filters-frequency sampling 48 Audio Visual

techniques. Aids

Realization of FIR systems: direct form, cascade form, 49 Lecture

linear phase form.
Tutorial 50 Tutorial

Tutorial 51 Tutorial
Course Teaching Materials:

Teaching materials such as Notes, PPT, Videos, etc. to be attached

Modul Course Teaching Materials

e No.

1 Notes
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

PPT
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

Videos
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

2 Notes
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

PPT
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

Videos
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

3 Notes
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

PPT
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

Videos
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

4 Notes
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

PPT
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

Videos
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
 usp=sharing

5 Notes
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

PPT
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

Videos
https://drive.google.com/drive/folders/1TfN2hCUWyIsbIu9IDeuREGYgNvU3HOMY?
usp=sharing

Virtual Laboratory:

Virtual Laboratory on Digital signal processing- IIT KHARAGPUR

http://vlabs.iitkgp.ernet.in/dsp/

Question Bank:

Module 1

1. Define DFT. Establish the relationship between DFS and DFT.

2. Determine the 8-point DFT of the sequence. x (n)  [1, 1, 1, 1,0,0,0,0]
3. Calculate the 4-point IDFT of the sequence.  ( )  [2 1- j 2 0 1  j 2 ]
4. A 498 point DFT of a real valued sequence x n  has the following DFT samples
given
 0  0, 11  7  j 3.1,   1   2.2  j1.5, 112   3  j 0.7,
  2   4.7  j1.9,  249   2.9,  309   4.7  j1.9,   3   3  j 0.7,
 412   2.2  j1.5, and ,   4   7  j 3.1.
5. Compute 4-point circular convolution of x1 (n)  [1, 0, 1, 1] and x 2 ( n)  [4,3,2,2]
by using DFT and IDFT method. Verify your result using matrix method.
6. Develop Circular time shift property

Module 2

1. Compute how many complex multiplication & complex addition are present in case of
direct computation of DFT and that in case of FFT for N=64
2. Determine the output y(n) of the FIR system whose impulse response is h(n)
=[1,1,1] and the input to the filter is x (n) = [1,2,-1,2,3,-2,-3,-1,1,1,2,-1].Use overlap
add method in your approach.
3. Determine the DFT of x(n)= {1,1,1,1,1,1,1,1} using radix-2 DIT-FFT algorithm.
4. Develop radix-2 DIF-FFT algorithm for N=8
 Module 3
1. Design FIR lowpass filter for the following response
H(ejω) = e-j2ω -π/4 ≤ ω ≤ π/4
0 π/4 ≤ ω ≤ π
Use Hamming window to determine filter coefficient and frequency response.
Take M=5
2. Design a 17-tap linear phase FIR filter with a cut off frequency ωc = π/2. The design
3. Obtain direct form structure for impulse response
 1 1 1 
h n   1, , , ,1
 4 8 4 
4. Realize the linear phase FIR filter having the following impulse equation
1 1 1
h n     n     n  1    n  2    n  3    n  4
4 8 4

Module 4
1. Obtain the direct form I & II realization of following IIR filter.
1 1
Z 1
 z   4
 1 1  1 1 1  2 
1  Z 1  Z  Z 
 2  2 4 
2. Design a Butterworth IIR analog filter for the following specifications
 Passband edge freq=1 rad/sec
 Stopband edge freq=3 rad/sec
 Passband attenuation= 0.9
 Stopband attenuation=0.1

3. Obtain the direct form I, II structures for the following difference equation

3 1 1
y n  y  n  1  y  n  2  x n   x n  1
4 8 3

Text Books:

1. Jhonny R. Jhonson “Introduction to Digital Signal Processing” Pearson 1st Edition,

2016

Web Resources:

VTU E-learning Resources http://nptel.vtu.ac.in/econtent/courses/ECE/06EC52/index.php

Blogs: profnitinkulkarni@blogspot.com

NPTEL/MOOCS: Digital signal processing – IIT Bombay

https://onlinecourses.nptel.ac.in/noc21_ee20/preview
Software: Matlab

Research Organizations / Industries in the field: Texas instruments, Analog devices, Qualcomm,
Samsung

Course Outcomes:

CO1: Analyze frequency domain sampling, reconstruction of discrete time signals to find DFT
& IDFT

CO2: Analyze linear filtering methods based on DFT & also FFT algorithms to determine
system output.
CO3: Design FIR filters using windowing technique

CO4: Realization of IIR digital systems

CO5: Design of FIR Digital Filters

CO-PO Matrix:

 CO PO1  PO2  PO3  PO4 PO5  PO6  PO7  PO8  PO9  PO10 PO11  PO12  PSO1 PSO2 PSO3
CO1 3 2 1 1

CO2 2 3 1 1

CO3 1 2 3 1 1

CO4 1 2 3 1 1

CO5 1 2 3 1 1
Avg. 2 2.25 3 1 1