Course Plan

EE 305 Digital Signal Processing

B. Tech (Electrical Engg.)                    Fifth Semester                                         L T P C : 3-0-0-3

Unit-1: Discrete-Time Signals & Systems: Advantages of digital over analog signal processing, discrete-time signals and sequences, representation of sequences and elementary operations, classification of discrete-time systems. Resolution of discrete-time signals into impulses, analysis of discrete-time LTI systems. Response to arbitrary inputs, the convolution sum, properties of LTI systems and their interconnections, causality, stability. Linear constant coefficient difference equation and their solutions. Impulse response of LTI system, response to complex exponential and sinusoidal signals, the frequency response function (10)

Unit-2: Sampling: Sampling of continuous time signals, periodic sampling, frequency-domain representation of sampling. Transforms: Representation of sequences by Fourier transforms-symmetry properties and theorems. The Z-transform, two-sided and one-sided z-transforms, ROC, properties of z-transform, Inverse z-transform, Analysis of LTI system in the Z-domain. Analysis of LTI System: System functionslinear constant coefficient difference equations, poles and zeros, rational system function, causality and stability, frequency response of LTI systems, phase distortion and delay, frequency response for rational system functions and for single pole or zero systems. (10)

Unit-3: Discrete Fourier Transforms: Frequency domain sampling, the DFT and properties of DFT, circular convolution, linear convolution using DFT, Application of DFT for A.C. transient analysis Efficient Computation of DFT: Computational complexity, FFT algorithms- the decimation-in-time and decimation-in-frequency; signal flow graph-Butterfly computations, in-place computations, analysis of computational complexities. (8)

Unit-4: Structures for Discrete-time Systems: Block diagram representation of linear constant coefficient difference equations and their interconnections. Direct form I, direct form II, cascade form and parallel form structures, Finite precision word-length effect-number representation, analysis of effect of coefficient quantization and rounding off of noise, zero input limit cycles in fixed point realization of IIR digital filters. (4)

Unit-5: Filter Design Techniques: Characteristics of practical frequency selective filters, design of FIR filters by windowing technique. Characteristics of Butterworth & Chebyshev filters, design of IIR filters from continuous time filters- impulse invariance and bilinear transformation methods. Multi-rate signal processing and introduction to Wavelets. VLSI implementation of digital filters and signal processing algorithms, implementation of signal processing algorithms in general purpose processor, specialized DSP processors. Applications of Signal Processing: Spectral analysis using DFT, musical sound and audio processing, application of signal processing in power system, fault detection and improving power quality. Implementing filters and other DSP algorithms using MATLAB programming and Simulink. (8)

Text and Reference:

1. Oppenhein and Schaffer. Discrete-time Signal Processing. PH

2. Proakis&Manolakis. Digital Signal Processing. PHI

3. T. K. Rawat. Digital Signal Processing. Oxford

4. Sanjit K. Mitra. Digital Signal Processing. TMH

5. Chen C.T.Digital Signal Processing: Spectral Computation& Filter Design. Oxford Univ. Press

6. V. K. Ingle & John J. Proakis. Digital Signal Processing using MATLAB. CENGAGE

Learning Course Outcomes (Cos):

At the end of the course the students will be able to

1. calculate the spectral coefficients and the Fourier series components of discretetime signals.

2. determine and analyze the frequency response and the z-transform of discrete-time systems.

3. design Finite Impulse Response (FIR) and Infinite Impulse Response (IIR) Filters and evaluate the performance to meet expected system specifications.

4. implement digital filters and DSP algorithms.

Class Notes & PPTs

1. - PPT