Discrete Fourier Transforms (DFT): Frequency domain sampling and
reconstruction of discrete time signals. DFT as a linear transformation, its
relationship with other transforms.
UNIT – II
Properties of DFT, multiplication of two DFTs- the circular convolution,
additional DFT properties, use of DFT in linear filtering, overlap-save and
overlap-add method.
UNIT – III
Fast-Fourier-Transform (FFT) algorithms: Direct computation of DFT, need
for efficient computation of the DFT (FFT algorithms).
UNIT – IV
Radix-2 FFT algorithm for the computation of DFT and IDFT–decimationin-
time and decimation-in-frequency algorithms. Goertzel algorithm, and
chirp-z transform
PART – B
UNIT – V
IIR filter design: Characteristics of commonly used analog filters –
Butterworth and Chebysheve filters, analog to analog frequency
transformations.
UNIT – VI
FIR filter design: Introduction to FIR filters, design of FIR filters using -
Rectangular, Hamming, Bartlet and Kaiser windows, FIR filter design using
frequency sampling technique
UNIT – VII
Design of IIR filters from analog filters (Butterworth and Chebyshev) -
impulse invariance method. Mapping of transfer functions: Approximation of
derivative (backward difference and bilinear transformation) method,
Matched z transforms, Verification for stability and linearity during mapping
UNIT – VIII
Implementation of discrete-time systems: Structures for IIR and FIR systemsdirect
form I and direct form II systems, cascade, lattice and parallel
realization.
REFERENCE
TEXT BOOKS:
1. Digital signal processing – Principles Algorithms &
Applications, Proakis & Monalakis, Pearson education, 4th Edition,
New Delhi, 2007.
Reference Books
1. Discrete Time Signal Processing, Oppenheim & Schaffer, PHI,
2003.
2. Digital Signal Processing, S. K. Mitra, Tata Mc-Graw Hill, 2nd
Edition, 2004.
3. Digital Signal Processing, Lee Tan: Elsivier publications, 2007