You are on page 1of 2
B.L.D.E. Association’s V.P. Dr. P.G.Halakatti. College of Engg. & Tech., Bijapur Department of Electronics and Communication

B.L.D.E. Association’s V.P. Dr. P.G.Halakatti. College of Engg. & Tech., Bijapur Department of Electronics and Communication Engineering Programme: B.E. in Electronics and Communication Engineering

B.L.D.E. Association’s V.P. Dr. P.G.Halakatti. College of Engg. & Tech., Bijapur Department of Electronics and Communication

Academic Year: 2016-17

LESSON PLAN

Semester/Div.: V / ‘B’

Subject: DIGITAL SIGNAL PROCESSING (10EC52)

Unit 1 : Discrete Fourier Transforms (DFT)

Number of Hours : 06

L1

Frequency domain sampling

L2

Reconstruction of discrete time signals, problems.

 

L3

DFT as a linear transformation Derivation.

 

L4

DFT as a linear transformation - Numerical.

 

L5

Its relationship with other transforms- with Fourier Series Coefficient of periodic sequence, Fourier transform of an aperiodic sequence.

L6

Relationship with other transforms- with z-transform, Fourier Series Coefficient of continuous-time signal.

Unit 2 : Properties of DFT

 

Number of Hours : 06

L7

Explain the properties of DFT : Periodicity, Linearity and Symmetry with proofs

L8

Understand the multiplication of two DFTs - the circular convolution.

L9

Prove and understand additional DFT properties: time reversal of a sequence and numerical.

L10

Circular time and frequency shift and numerical.

 

L11

Circular correlation and Complex-conjugate and numerical.

L12

Parseval’s theorem and numerical.

 

Unit 3 : Use of DFT

 

Number of Hours : 07

L13

Derive Filtering of Long Data Sequences: overlap-save method and solve numerical.

L14

Derive Filtering of Long Data Sequences: overlap-add method and solve numerical.

L15

Computations needed for Direct computation of DFT.

L16

Storage needed for data in Direct computation of DFT.

L17

FFT algorithm explanation and introduction

 

L18

Computations needed for FFT & Storage needed for data in FFT.

L19

Comparison of FFT with papers

Direct method of DFT & Revision and solution of question

Unit 4 - Radix-2 FFT Algorithm

 

Number of Hours : 07

L21

Radix-2 FFT for DFTdecimation-in-time algorithm

L22

Radix-2 FFT for IDFTdecimation-in-time algorithm

L23

Radix-2 FFT for

DFT decimation-in-frequency algorithms.

L24

Radix-2 FFT for IDFTdecimation-in-frequency algorithms.

L25

Goertzel algorithm,

L26

Chirp-z transform.

Unit 5 : IIR Filter Design

 

Number of Hours : 06

L27

Characteristics of analog filters Butterworth.

 

L28

Chebyshev filters.

L29

Design of specified IIR filter.

L30

Problems on Butterworth and Chebyshev filters.

.

L31

Design of prototype filter

L32

Transformation to other analog filters

Unit 6: Implementation of discrete-time systems

 

Number of Hours : 07

L33

Implementation of discrete-time systems: Structures for IIR systems - direct form I and direct form II systems, cascade, lattice and

L34

Implementation of discrete-time systems: Structures for IIR systems - cascade, lattice cascade, lattice

L35

Implementation of discrete-time systems: Structures for IIR systems parallel realization

L36

Implementation of discrete-time systems: Structures for FIR systems - direct form I and direct form II systems

L37

Implementation of discrete-time systems: Structures for FIR systems - cascade, lattice

L38

Implementation of discrete-time systems: Structures for FIR systems - parallel realization

L39

Numericals.

Unit 7 : FIR filter design

 

Number of Hours : 06

L40

Introduction to FIR filters

L41

Design of FIR filters using - Rectangular,

 

L42

Design of FIR filters using -Hamming, Bartlet windows

 

L43

Design of FIR filters using - Kaiser windows

 

L44

FIR filter design using frequency sampling technique.

 

L45

Revision and Question Paper Solving

Unit 8 : Design of IIR filters from analog filters

 

Number of Hours : 07

L46

Design of IIR filters from analog filters using impulse invariance method.

L47

Design of IIR filters from analog filters using mapping of transfer functions:

L48

Design of IIR filters from analog filters using difference) method.

Approximation of derivative (backward

L49

Design of IIR filters from analog filters using bilinear transformation.

L50

Design using matched z transforms.

L51

Verification for stability and linearity during mapping.

 

L52

Revision and solving of question papers.