Objective
To introduce digital signal processing techniques and algorithms
Syllabus
- Discrete time signals and systems
- Discrete time signal, basic signal types
- Energy signal, power signal
- Periodicity of discrete time signal
- Transformation of independent variable
- Discrete time Fourier series and properties
- Discrete time Fourier transform and properties
- Discrete time system properties
- Linear time invariant (LTI) system convolution sum, properties of LTI system
- Frequency response of LTI system
- Sampling of continuous time signal, spectral properties of sampled signal.
- Z-transform
- Defintion, convergence of Z-transform and region of convergence
- Properties of Z-transform (linearity, time shift, multiplication by exponential sequence, differentiation, time reversal, convolution, multiplication)
- Inverse z-transform by long division and partial fraction expansion.
- Analysis of LTI system in frequency domain
- Frequency response of LTI system, response to complex exponential
- Linear constant co-efficient difference equation and corresponding system function
- Relationship of frequency response to pole-zero of system
- Linear phase of LTI system and its relationship to causality.
- Discrete filter structures
- FIR filter, Structures for FIR filter (direct form, cascade, frequency sampling, lattice)
- IIR filter, structures for IIR filter (direct form I, direct form II, cascade, lattice, lattice ladder)
- Quantization effect ( truncation, rounding), limit cycles and scaling.
- FIR filter design
- Filter design by window method, commonly used windows ( rectangular window, Hanning window, Hamming window)
- Filter design by Kaiser window
- Filter design by frequency sampling method
- Filter design using optimum approximation, Remez exchange algorithm.
- IIR filter design
- Filter design by impulse invariance method
- Filter design using bilinear transformation
- Design of digital low pass Butterworth filter
- Properties of Chebyshev filter, properties of elliptic filter, properties of Bessel filter, Spectral transformation.
- Discrete Fourier transform
- Discrete Fourier transform (DFT) representation, properties of DFT (linearity, time shift, frequency shift, conjugation and conjugate symmetry, duality, convolution, multiplication), circular convolution
- Fast Fourier Transform (FFT) algorithm (decimation in time algorithm, decimation in frequency algorithm)
- Computational complexity of FFT algorithm.