DIGITAL SIGNAL PROCESSING (18EE63)

 

DIGITAL SIGNAL PROCESSING

Course Code 18EE63 
CIE Marks 40
Number of Lecture Hours/Week (L:T:P)
(L:T:P) 3:2:0 
SEE Marks 60
Credits 04 
Exam Hours 03

Course Learning Objectives:

• To define Discrete Fourier transform and its proper ties.
• To evaluate DFT of various signals using properties of DFT.
• To explain different linear filtering techniques.
• To explain the evaluation of DFT and inverse DFT using fast and efficient al gorithms
• To discuss impulse invariant transformation, bilinear transformation techniques and their    proper ties.
• To design infinite impulse response Butterworth digital filters using impulse invariant and
bilin ear transformation techniques.
• To design infinite impulse response Chebyshev digital filters using impulse invariant and
bilin ear transformation techniques.
• To discuss direct, cascade, parallel and ladder methods of realizing a digital IIR filter.
• To discuss window functions used for the design of FIR filters.
• To discuss windowing technique of designing FIR filter.
• To discuss frequency sampling technique of designing FIR filter.
• To discuss direct, cascade and linear phase form of realizing a digital FIR filter.

Module-1

Discrete Fourier Transforms: Definitions, properties-linearity, shift, symmetry Properties- circular convolution – periodic convolution, use of tabular arrays, circular arrays, Stock ham’s method, linear convolution – two finite duration sequence, one finite & one infinite duration, overlap add and save methods.

Click here to download Module-1

Module-2

Fast Fourier Transforms Algorithms: Introduction, decimation in time algorithm, first
decomposition, number of computations, continuation of decomposition, number of mul ti plicati ons, computational efficiency, decimation in frequency algorithms, Inverse radix – 2 algor ithms.

Click here to download Module-2

Module-3

Design of IIR Digital Filters: Introduction, impulse invariant transformation, bilinear
transformations, All pole analog filters- Butterworth & Chebyshev filters, design of digital Butterworth filter by impulse invariant transformation and bilinear transformation, Frequency transformations.

Click here to download Module-3

Module-4

Design of IIR Digital Filters (Continued): Design of digital Chebyshev –type 1filter by impulse invariant transformation and bilinear transformation, Frequency transformations.
Realization of IIR digital systems: direct form, cascade form and parallel form, Ladder struct ur es for equal degree polynomial . 

Click here to download Module-4

Module-5

Design of FIR Digital Filters: Introduction, windowing, rectangular, modified rectangular. Hamming, Hanning, Blackman window, design of FIR digital filters by use of windows, Design of FIR digital filters-frequency sampling techniques.
Realization of FIR systems: direct form, cascade form, linear phase form.

Click here to download Module-5

Important links:

1. Click here to download the question bank

2. Click here to download Previous Year Question Papers

3. Click here to download Solved Previous Year Question Papers

Course Outcomes: At the end of the course the student will be able t o:

• Apply DFT and IDFT to perform linear filtering techniques on given sequences to determine the output.
• Apply fast and efficient algorithms for computing DFT and inverse DFT of a given sequence
• Design and realize infinite impulse response Butterworth and Chebyshev digital filters using impulse invariant and bilinear transformation techniques.
• Develop a digital IIR filter by direct, cascade, parallel, ladder and FIR filter by direct, cascade and linear phase methods of realization.
• Design and realize FIR filters by use of window function and frequency sampling method.

Question paper pattern:

• The question paper will have ten questi ons.
• Each full question is for 20 marks.
• There will be 2 full questions (with a maximum of three sub questions in one full
question)from each modul e.
• Each full question with sub questions will cover the contents under a modul e.
• St udents will have to a nswer 5 ful l questi ons, selecting on e ful l questi on from each modul e.

Text Book:

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

Reference Books

1. Digital Signal Processing – Pr inciples, Algorithms, and Applications Jhon G. Proakis
Dimitris G. Manola kis Pearson 4th Edition, 2007.
2. Digital Signal Processing A.NagoorKani McGraw Hill 2nd Edition, 2012
3 Digital Signal Processing Shaila D. Apte Wiley 2nd Edition, 2009
4 Digital Signal Processing Ashok Amberdar Cengage 1st Edition, 2007
5 Digital Signal Processing Tarun Kumar Rawat Oxford 1st Edition, 2015