Proposal of M.Tech - CSP - EE (2023-24)
Proposal of M.Tech - CSP - EE (2023-24)
for
Master of Technology (M.Tech.)
Programme
in
Electrical Engineering
Specialization: Communication and
Signal Processing
1
Semester-wise Credit Distribution
Semester Credits
I 17
II 15
III 13
IV 15
Total Credits 60
2
1. Programme Credit Structure
Table 1: Proposed Plan for M.Tech. in Electrical Engineering (Specialization: Communication and
Signal Processing)
3
3. RF System (3-0-0): 3
4. Digital Communications (3-0-0): 3
5. Introduction to Machine learning (3-0-0): 3
4
M. Tech. Program
Semester-wise Distribution of Courses
Semester-I
Faculty Members
SI. No. Course Total Credits Credits
Code Course Name (L-T-P)
Ankit Dubey/
1 EEL001P1 (3-0-0) 3 Ravikant Saini/
M Signal Theory Ajay Singh/ Ankur
Bansal
Karan
2 EEL002P1 (3-0-0) 3 Nathwani/Badri N
M Advanced Digital Subudhi
Signal Processing
Kushmanda
3 EEL003P1 (3-0-0) 3 Saurav/Alok
M RF System Saxena/Archana
Rajput
Ankit Dubey/
4 EEL004P4 (3-0-0) 3 Ravikant Saini/
M Digital Ajay Singh/ Ankur
Communications Bansal
5
Karan
5 EEP002P1 (0-0-2) 1 Nathwani/Badri N
M Lab-I: Advanced Subudhi
Digital Signal
Processing
Ankit Dubey/
6 EEP004P4 (0-0-2) 1 Ravikant Saini /
M Lab-II: Digital Ajay Singh
Communication Lab
Kushmanda
7 EEP003P1 (0-0-2) 1 Saurav/Alok
M Lab-III: RF Systems Saxena/Archana
Rajput
Total Credits 17
6
Semester-II
Faculty Members
SI. Course Course Name Total Credits
No. Code Credits
(L-T-P)
Badri N.
1 Introduction to Machine (3-0-0) 3 Subudhi/Karan
Learning Nathwani
Corresponding
2 Elective-I (3-0-0) 3 Faculty
Corresponding
3 Elective-II (3-0-0) 3 Faculty
Corresponding
4 Elective-III (3-0-0) 3 Faculty
Corresponding
7
5 Elective-IV (3-0-0) 3 Faculty
Total Credits 15
*Special Modules will be floated if any visiting faculty/Industrialist visits the campus and will offer a course for 2 weeks (1 credit)/4 weeks (2
credits).
Semester-III
Faculty Members
SI.No. Course Course Name Total Credits
Code Credits
(L-T-P)
Corresponding
1 Elective-V (3-0-0) 3 Faculty
All Faculties
2 EEZ111P Dissertation I (0-0-20) 10
2M
Total Credits 13
8
Semester-IV
Faculty
SI. No. Course Course Name Total Credits Credits Members
Code (L-T-P)
All faculties
1 EEZ111P Dissertation II (0-0-30) 15
2M
Total Credits 15
9
List of Electives
1.Digital Image Processing (3-0-0): 3
10
20.VLSI Technology (3-0-0): 3
35.Tools for Optimization (Master Course Compulsory for all students) (3-0-0):3
11
40.Advanced Digital System Design (3-0-0):3
Learning Outcomes:
The course is meant for graduate students to make them familiar with signal theory. It provides a
review of axioms of probability, single and multivariate distributions, and functions of random
variables, mean-squared convergence, convergence in distribution, the central limit theorem, random
waveforms, signal spaces,autocorrelation and the power spectrum, random processes.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 10 Hours
Discrete random variables (Bernoulli, binomial, Poisson, geometric, negative binomial, etc.) and
their properties like PDF, CDF, MGF.
MODULE 2 10 Hours
Continuous random variables: Gaussian, multivariate Gaussian; whitening of the Gaussian
random vector; complex Gaussian random vector, circularity; Rayleigh and Rician; exponential;
chi-squared; gamma.
MODULE 3 10 Hours
12
Signal spaces: convergence and continuity; linear spaces, inner product spaces; basis,
Gram-Schmidt orthogonalization, Stochastic convergence, law of large numbers, central limit
theorem.
MODULE 4 12 Hours
Random processes: stationarity; mean, correlation, and covariance functions, WSS random
process; autocorrelation and cross-correlation functions; transmission of a random process
through a linear filter; power spectral density; white random process; Gaussian process; Poisson
process. Random process representation – Karhunen –Loeve Expansion, Sampling Expansion;
introduction to mean-square estimation; Wiener – Hopf filtering. Introduction to Markov
processes.
References:
1. A. Papoulis and S. U. Pillai, "Probability, Random Variables, and Stochastic Processes,"
4th edition, New York, NY: McGraw-Hill, 2002
2. L. E. Franks, "Signal Theory," Englewood Cliffs, NJ: Prentice-Hall, 1969
Digital Communication
3-0-0
Learning Outcomes:
The course is meant for graduate level students and covers in detail receiver designs for digital
communications using statistical communication theory principles and Signal Space concepts for
optimum receiver design. It will also involve analyzing advanced digital communication systems
analytically and using MATLAB simulation. The course also covers digital wireless multiple
access systems techniques like CDMA & OFDM. MIMO systems will also be discussed to
achieve receive & transmit diversity and multiplexing gains.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 7 Hours
Introduction to Digital Communication
Review of random variables and random process, signal space concepts
MODULE 2 7 Hours
Digital modulation techniques
Sampling, PCM, DM, Common modulated signals and their power spectral densities
MODULE 3 7 Hours
13
Optimal Receivers
Optimum receivers for Gaussian channels, Coherent and non-coherent receivers and their
performance (evaluating BER performance through software tools),
MODULE 4 7 Hours
Information and coding Theory
Basics of Information theory, source and channel coding, capacity of channels.
MODULE 5 7 Hours
Multiple access techniques
Multicarrier and spread-spectrum communication
MODULE 6 7 Hours
Advanced topics
Carrier and Symbol Synchronization, Communication over Band Limited Channels, Digital
Communication over Fading Channels
References:
1. Modern digital and analog communication systems, Lathi and Ding, Oxford University
press, 4th edition.
2. Digital Communication, Haykin S., Wiley
3. Digital Communication, Proakis, McGraw Hill, 4th edition
RF Systems
3-0-2
Learning Outcomes:
The course outlines the design of microwave coupler and dividers, filters and their
implementation, microwave amplifiers, active microwave devices, oscillators and mixers. A
slight introduction of network analysis is covered. It also highlights the distortions caused by the
noise in microwave circuits. Microwave systems are also discussed.
Assessment Criterion
1)Laboratory : 25 %
2) Theory Course : 75 %
MODULE 1 10 Hours
MODULE 2 4 Hours
14
Microwave Network Analysis: Two Port Network Parameters, Scattering Matrix and its
Properties
MODULE 3 10 Hours
Power Divider and Couplers: Basic Properties of Couplers and Power Dividers, T-junction
Power Divider, Resistive Power Divider, Wilkinson Power Divider, Branch Line Couplers (90
degree hybrid), Rat Race (180 degree hybrid) Coupler, Coupled Line Coupler: Single and
Multi-Sections
MODULE 4 14 Hours
Microwave Filters: Periodic Structures, Filter Design by Image Parameter Method, Filter
Design by Insertion Loss Method, Filter Transformations, Filter Implementation, Stepped
Impedance Low Pass Filter,, Coupled Line Filters
MODULE 5 6 Hours
Microwave Amplifiers: Amplifier basics, Stability Circles, Gain Circles, Maximum Gain
Designs
References:
RF System Lab:
15
4. Design of Branch Line Coupler (90-degree hybrid) 2
16
Advanced DSP
3-1-1
Learning Outcomes:
The course will briefly provide the review of signals and systems. It explains about digital filtering
which involves design and quantization effects of digital filters. Multirate filterings,
Cyclostationarity and LPTV filters and wavelet transform are covered in the course.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 5 Hours
Review of Signals and Systems: This module includes Band Pass Sampling and data
reconstruction processes. Z Transform, Definition of Z Transform, Importance of Z transform
over Fourier Transform, Properties of Z Transform and Inverse Z Transform. Discrete linear
systems.
MODULE 2 5 Hours
Frequency domain design of Digital filters: This module includes design of FIR and IIR filters
in frequency domain.
MODULE 3 5 Hours
Quantization effects in Digital Filters : This module includes Distribution of Truncation
Errors, Quantization of Filter Coefficients and Quantization of Pole Locations.
MODULE 4 5 Hours
Discrete Fourier transform and FFT algorithms: This module includes definition of DFT and
its properties. It also describes the fast computation of DFT which is FFT.
MODULE 5 4 Hours
High speed convolution and its application to digital filtering : This module includes Theory
of Convolution Filters, Approximation to the Filters and Accuracy of the Approximation Filters.
MODULE 6 5 Hours
Introduction to Multirate signal processing: This module deals with decimation and
interpolation concepts of sampling theorem.
MODULE 7 5 Hours
Multirate filtering and Filter banks: This module presents Polyphase decomposition and
perfect reconstruction.
MODULE 8 5 Hours
Cyclostationarity and LPTV filters : This module describes Cyclostationary and Linear
Periodically Time Varying (LPTV) filters.
17
MODULE 9 3 Hours
Introduction to Wavelet Transform : This module deals with Wavelet transform, its
similarities and differences over Fourier Transform. It also explain its application in speech and
audio processing.
References:
1. Discrete-Time Signal Processing, 3/E, Alan V. Oppenheim and Ronald W. Schafer
2. Digital Signal Processing, 3/e, Sanjit K Mitra
ADSP : LAB Course
18
2. 3. To obtain the impulse response of a difference equation. 4
5. 8. To study the real-time audio signal using a DSP kit and to study the delayed 8
version of an audio signal using a DSP kit.
9. To study the FIR filter.
10. To generate a real-time sine wave, square wave and ramp wave using DSP kit.
Main References
Reference Books:
1.Reay, Donald. Digital Signal Processing Using the ARM Cortex-M4. Hoboken, New Jersey:
John Wiley & Sons, Inc., 2016.
2. Furber, Steve. ARM System-on-Chip Architecture, Addison-Wesley
Educational Publishers Inc; 2nd edition, 2000
3. Ünsalan, Cem and Yücel, M. Erkin and Gürhan, H. Deniz. Digital Signal Processing using
Arm Cortex-M based Microcontrollers: Theory and Practice, ARM Limited, 2018
4. Esakkirajan, S. and Veerakumar, T. Subudhi, Badri N. Digital Signal Processing. Tata
McGraw Hill: New Delhi, 2021
19
5. Course Number EE
6. Status ( Category for Program) DC
7. Prerequisite
8. Status vis a vis other course No overlap
9. Not allowed for (indicate program names) Allowed for all
10 Frequency of offering Every Odd Semester
11 Faculty who will teach the course
12 Will the course require any visiting faculty No
13. Course Objective (50 words)
This course aims at introducing the students to the fundamentals of machine learning (ML)
techniques useful for various signal processing applications. It will discuss various mathematical
methods involved in ML, thereby enabling the students to design their own models and optimize
them efficiently. The lectures will focus on mathematical principles, and there will be coding
based assignments for implementation. Prior exposure to ML is not required.
Reference Books:
- "Pattern Recognition and Machine Learning", C.M. Bishop, 2nd Edition, Springer,
2011.
- "Deep Learning", I. Goodfellow, Y, Bengio, A. Courville, MIT Press, 2016.
- "Automatic Speech Recognition: A Deep Learning Approach", D. Yu and L. Deng,
Springer, 2016.
ELECTIVE COURSES
20
This post graduate course is designed to cover techniques for adaptive signal processing,
detection and parameter estimation. It will briefly introduce the structure of adaptive filters,
issues and their applications. Discrete time stochastic processes are discussed. The course will
deal with the search methods, wiener filter and the LMS algorithm; LMS algorithm is covered in
great detail. The course will provide students knowledge about the vector space work for optimal
filtering, the lattice filter and estimator.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 5 Hours
Introduction to Adaptive Filters: Adaptive filter structures, issues and examples, Applications
of adaptive filters, Channel equalization, active noise control, Echo cancellation, beam forming.
MODULE 2 6 Hours
Discrete time stochastic processes: Re-visiting probability and random variables, Discrete time
random processes, Power spectral density – properties, Autocorrelation and covariance structures
of discrete time random processes, Eigen-analysis of autocorrelation matrices.
MODULE 3 5 Hours
Wiener filter, search methods and the LMS algorithm: Wiener FIR filter (real case), Steepest
descent search and the LMS algorithm, Extension of optimal filtering to complex valued input,
The Complex LMS algorithm.
MODULE 4 6 Hours
Convergence and Stability Analyses: Convergence analysis of the LMS algorithm, Learning
curve and mean square error behavior, Weight error correlation matrix, Dynamics of the steady
state mean square error (MSE), Misadjustment and stability of excess MSE.
MODULE 5 5 Hours
Variants of the LMS Algorithm: The sign-LMS and the normalized LMS algorithm, Block
LMS, Review of circular convolution, Overlap and save method, circular correlation, FFT based
implementation of the block LMS Algorithm.
MODULE 6 5 Hours
Vector space framework for optimal filtering: Axioms of a vector space, examples, subspace,
Linear independence, basis, dimension, direct sum of subspaces, Linear transformation,
examples, Range space and null space, rank and nullity of a linear operator, Inner product space,
orthogonality, Gram-Schmidt orthogonalization, Orthogonal projection, orthogonal
decomposition of subspaces, Vector space of random variables, optimal filtering as an orthogonal
projection computation problem.
MODULE 7 5 Hours
The lattice filter and estimator: Forward and backward linear prediction, signal subspace
decomposition using forward and backward predictions, Order updating the prediction errors and
prediction error variances, basic lattice section, Reflection coefficients, properties, updating
21
predictor coefficients, Lattice filter as a joint process estimator, AR modeling and lattice filters,
Gradient adaptive lattice.
MODULE 8 5 Hours
RLS lattice filter: Least square (LS) estimation, pseudo-inverse of a data matrix, optimality of
LS estimation, Vector space framework for LS estimation, Time and order updating of an
orthogonal projection operator, Order updating prediction errors and prediction error power,
Time updating PARCOR coefficients.
References:
1. “Adaptive Filter Theory” by S. Haykin, Prentice Hall, Englewood Cliffs, NJ, 1991 (end
Ed.).
2. “Adaptive Filters Theory and Applications”, by B. Farhang-Boroujeny, John Wiley and
Sons, 1999.
3. “Adaptive Signal Processing”, by B. Widrow and S.D. Stearns, Prentice Hall, Englewood
Cliffs, NJ, 1985.
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 14 Hours
Overview of the course, Classical Decision Theory: Binary hypothesis testing: Bayes criterion,
Neyman-Pearson criterion, min-max test,M-ary hypothesis testing: General rule, minimum
probability of error decision rule, Gaussian case and associated geometric concepts, Erasure
decision problem, Random parameter estimation.
MODULE 2 14 Hours
22
Non – random parameter estimation: CRLB for nonrandom parameters, ML estimation rule,
asymptotic properties of ML estimates. Linear minimum variance estimation, Least squares
methods CRLB for random parameter estimation, condition for statistical efficiency, Multiple
parameter estimation, Composite and non-parametric hypothesis testing, Applications, Detection
of signals.
MODULE 3 14 Hours
Mathematical preliminaries: K-L expansion and its application to Detection of known and
un-known (i.e. with unknown, parameters) signals in AWGN., Detection of signals in colored
noise. Linear estimation, Wiener filters and solution of Wiener Hopf Equations,Kalman- Bucy
filters, Miscellaneous estimation techniques. Introduction to non-parametric detection.
References:
1. Detection ,Estimation and Modulation Theory , Part I ,H. L. Van Trees.
2. Decision and Estimation Theory , Melsa & Cohn , MGH publications.
3. Detection of Signals in Noise , A.D. Whalen ( Academic Press,1971).
Antenna and Wave Propagation
3-0-0
Learning Outcomes:
The course will provide students with an in depth introduction to fundamental parameters of
antennas, Friis and radar equations. The course also covers antenna arrays, linear wire and loop
antennas, antenna synthesis and antenna measurements. Different types of antennas are discussed
in great detail for the students.
Assessment Criterion
1) Examination : 100%
MODULE 1 8 Hours
Fundamental Parameters of Antennas
Radiation Pattern, Radiation Power Density, Radiation Intensity, Beamwidth, Directivity,
Antenna Efficiency, Gain, Beam Efficiency, Bandwidth, Polarization, Input Impedance, Antenna
Radiation Efficiency, Antenna Vector Effective Length and Equivalent Areas, Maximum
Directivity and Maximum Effective Area, Friis Transmission Equation and Radar Range
Equation
MODULE 2 4 Hours
Radiation Integrals and Potential Functions
Vector Potential A for an Electric Current Source J, Vector Potential F for a Magnetic Current
Source M, Electric and Magnetic Fields for Electric (J) and Magnetic (M) Current Sources,
23
Solution of the inhomogeneous Vector Potential Wave Equation, Far-field Radiation, Duality
Theorem, Reciprocity and Reaction Theorems
MODULE 3 10 Hours
Linear Wire Antennas
Infinitesimal Dipole, Small Dipole, Region Separation, Finite Length Dipole, Half-wave Dipole,
Linear Elements Near or on Infinite Perfect Conductors
MODULE 4 12 Hours
Antenna Arrays
Two-Element Array, N-Element Linear Array: Uniform Amplitude and Spacing, N-Element
Linear Array: Uniform Spacing, Non Uniform Amplitude, Planar Array
MODULE 5 8 Hours
Aperture and Microstrip Antennas
Field Equivalence Principle: Huygen’s Principle, Radiation Equations, Directivity, Rectangular
Apertures, Rectangular Patch: Transmission Line Model, Cavity Model
References:
1. C.A. Balanis, “Antenna Theory Analysis and Design”, Wiley, Third Edition.
Learning Outcomes:
Equip students with an understanding of microwave and millimeter wave integrated
circuits with a special emphasis on active circuits.
Assessment Criterion
1) TermPaper/mini Project : 30 %
2) Examination : 70 %
MODULE 1 8 Hours
Introduction to RF: Transmission Line and their types, Impedance Matching, Power
Transfer Analysis, Applications of Smith Chart in RF circuit design, S-parameters
MODULE 2 6 Hours
Active RF and Microwave devices: Schottky Diodes, PIN Diodes, Varactor Diodes,
Microwave Bipolar Junction Transistors, Microwave Field Effect Transistors, Microwave
Integrated Circuits
24
MODULE 3 6 Hours
Noise and Non-linear Distortion: Noise in Microwave Circuits, Noise Figure, Nonlinear
Distortion, Dynamic Range
MODULE 4 14 Hours
Microwave Amplifier Design: Stability, Transistor Amplifier Design, Power Amplifiers
MODULE 5 8 Hours
Microwave Oscillator and Mixers: RF Oscillators, Frequency Multipliers, Mixers
References:
Learning Outcomes:
Equip students with an understanding of digital image processing: image enhancement,
color image analysis, segmentation.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 4 Hours
Digital image Fundamentals:
Elements of Visual Perception, Light and the Electromagnetic Spectrum, Image Sensing
and Acquisition, Image Sampling and Quantization, Some Basic Relationships between
Pixels, Linear and Nonlinear Operations.
MODULE 2 8 Hours
Image Enhancement in spatial domain:
Basic Gray Level Transformations, Histogram Processing, Basics of Spatial Filtering,
Smoothing Spatial Filters, Sharpening Spatial Filters.
25
MODULE 3 5 Hours
Color Image Processing:
Color Fundamentals, Color Models, Pseudocolor Image Processing, Basics of Full-Color
Image Processing, Color Transformations, Smoothing and Sharpening, Color
Segmentation.
MODULE 4 6 Hours
Image Segmentation:
Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding,
Region-Based Segmentation, Segmentation by Morphological Watersheds.
MODULE 5 6 Hours
Morphological Image Processing:
Morphological Image Processing, Dilation and Erosion, opening and Closing, Extensions
to Gray-Scale Images.
MODULE 6 6 Hours
Image Compression:
Coding, Interpixel and Psychovisual Redundancy, Image Compression models,
Compression standards
References:
1. Digital Image Processing, 3rd Ed. (DIP/3e) by Gonzalez and Woods © 2008
2. Fundamentals of Digital Image Processing by Anil K. Jain, Prentice Hall, 1989
Computational Electromagnetics
3-0-0
Learning Outcomes:
The course provides a basic review of electromagnetic theory and an introduction to
computational electromagnetic. It will help students to understand finite difference methods,
method of moments and finite element methods.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 6 Hours
26
Review of electromagnetic theory, Introduction to computational electromagnetic
MODULE 2 12 Hours
Finite difference methods: Basic components of finite difference solvers, Wave equation (1-D
FDTD method), Laplace’s equation (2-D FDM), 2-D FDTD method, 3-D FDTD method,
Perfectly matched layer
MODULE 3 12 Hours
Method of Moments: Integral formulation of electrostatics, Capacitance problem in unbounded
2D region, Electromagnetic scattering, Scattering on thin wires, Analysis of microstrip antennas
and circuits, EM absorption in human body
MODULE 4 12 Hours
Finite element method: Overview, Laplace’s equation (1-D FEM), Boundary condition for FEM,
Helmholtz equation (2-D FEM), Finite element method-boundary element method, FEM/MOM
hybrid, Time domain FEM, Fast multipole method.
References:
1. K. F. Warnick, "Numerical methods for engineering," SciTech, 2011.
2. A. Bondeson, T. Rylander and P. Ingelstrom, "Computation Electromagnetics," Springer,
2005.
3. M. N. O. Sadiku, "Numerical Techniques in Electromagnetics," CRC Press, 2001.
4. J. M. Jin, "Theory and Computation of Electromagnetic Fields," John Wiley, 2010.
5. D. B. Davidson, "Computational Electromagnetics for RF and Microwave Engineering,"
Cambridge University Press, 2011
Learning Outcomes:
The course provides strong theoretical foundation for statistical characterization and analysis of
signals to the students. It helps understanding the performance of adaptive filtering algorithms.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 3 Hours
Random variables, geometric concepts, GS Orthogonalization
MODULE 2 6 Hours
Random process, autocorrelation and PSD, properties of autocorrelation matrices
27
MODULE 3 15 Hours
Optimum linear filtering, LMS and its performance, least squares
MODULE 4 8 Hours
SVD and QR decompositions, RLS and its performance
MODULE 5 10 Hours
Kalman filtering, spectrum modeling
References:
1. Simon Haykin, “Adaptive Filter Theory,” Pearson, fourth edition.
2. Monson Hayes, “Statistical Digital Signal Processing and Modelling,” Wiley, 2009.
Communications Networks
3-0-0
Learning Outcomes:
The course will introduce students with the basic concepts of networking, TCP and UDP, TCP
analysis. It will help them in understanding the algorithms for shortest path routing, routing
protocols, optimal routing. Various performance measures and analysis of the network are
discussed.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 6 Hours
Introduction to networking, TCP and UDP, TCP analysis
MODULE 2 10 Hours
IP, optimal routing, algorithms for shortest path routing, routing protocols, Mobile IP
MODULE 3 10 Hours
ARQ schemes and analysis, random access, random/slotted ALOHA, splitting algorithms,
CSMA-CD, wireless LANs CSMA/CA, IEEE 802.11 MAC
MODULE 4 10 Hours
Modeling and performance analysis in networks; deterministic analysis, scheduling; stochastic
analysis - traffic models
MODULE 5 6 Hours
Performance measures, Little's Theorem, M/G/1 model, Priority queuing
References:
28
1. A. Kumar, D. Manjunath, and J. Kuri, Communication Networking: An Analytical
Approach, Morgan Kaufman Publishers, 2004.
2. D. Bertsekas and R. Gallager, Data Networks, 2nd Edition, Prentice-Hall India, 2002.
3. J. F. Kurose and K. W. Ross, Computer Networking: A Top-Down Approach Featuring
the Internet, Pearson Education Asia, 2001.
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 3 Hours
Introduction to entropy, relative entropy, mutual information, fundamental inequalities
MODULE 2 8 Hours
Asymptotic equipartition property, entropy rates of stochastic process
MODULE 3 8 Hours
Data compression, Differential entropy
MODULE 4 15 Hours
Channel Capacity, The Gaussian channel
MODULE 5 8 Hours
Rate distortion theory
References:
1. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ED.,John Wiley &
Sons, New Jersey, USA, 2006.
2. T. S. Han, Information-Spectrum Method in Information Theory, Springer-Verlag Berlin
Heidelberg, 2003.
29
3. I. Csiszar and J. Korner, Information Theory: Coding Theorems for Discrete Memoryless
Systems, 2nd edition, Cambridge University Press, 2011.
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 10 Hours
Spatial Signals:- Signals in space and time,Spatial frequency, Direction vs. frequency, Wave
fields, Far field and Near field signals.
MODULE 2 12 Hours
Sensor Arrays:- Spatial sampling, Nyquist criterion. Sensor arrays. Uniform linear arrays, planar
and random arrays. Array transfer (steering) vector. Array steering vector for ULA. Broadband
arrays.
MODULE 3 10 Hours
Spatial Frequency :- Aliasing in spatial frequency domain. Spatial Frequency Transform, Spatial
spectrum. Spatial Domain Filtering. Beam Forming. Spatially white signal.
MODULE 4 10 Hours
Direction of Arrival Estimation :- Non parametric methods – Beam forming and Capon methods.
Resolution of Beam forming method. Subspace methods – MUSIC, Minimum Norm and
ESPRIT techniques. Spatial Smoothing.
References:
1. Dan E. Dugeon and Don H. Johnson. (1993). Array Signal Processing: Concepts and
Techniques. Prentice Hall.
2. Petre Stoica and Randolph L. Moses. (2005, 1997) Spectral Analysis of Signals. Prentice
Hall.
3. Bass J, McPheeters C, Finnigan J, Rodriguez E. Array Signal Processing [Connexions
Web site]. February 8, 2005. Available at: http://cnx.rice.edu/content/col10255/1.3/
30
Multidimensional Signal Processing
3-0-0
Learning Outcomes:
The course will help in Comprehending the concepts of multi-dimensional signals and systems,
Apply these concepts to acquire, process and display two or multi-dimensional signals. The
students are able to understand the concept of 2D sampling theorem and sampling with different
sampling geometries. It will help in designing and implementation of various types of
two-dimensional digital filters given a set of specifications. The course helps in exploring
various applications and related research areas.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 14 Hours
Multidimensional Systems- Fundamental operations on Multidimensional signals, Linear Shift -
Invariant systems-cascade and parallel connection of systems- separable systems, stable systems-
Frequency responses of 2D LTI Systems- Impulse response, Multidimensional Fourier
transforms, z-transforms, properties of the Fourier and z-transforms
MODULE 2 14 Hours
Multidimensional Discrete Fourier Transform: - Properties of DFT, Circular convolution-
Calculation of DFT- Fast Fourier transform for periodically sampled signals Sampling
continuous 2D signals Periodic sampling with rectangular geometry- sampling density, Aliasing
effects created by sampling - Periodic sampling with different sampling geometrics: rectangular,
hexagonal and Quincunx - comparison
MODULE 3 14 Hours
Multidimensional Digital Filter Design- Separable Filters- Linear phase filters- FIR Filters-
Implementation of FIR filters - design of FIR filters using windows-Two dimensional window
functions, Filter design using transformations, McClellan transformation-disadvantages, New
transformations such as T1, T2, P1, and H1 transformations-Contour approximation
errors-Circularly symmetric and fan type filters – implementation- applications in image
processing
References:
31
1. John W Woods, Multidimensional Signal Image and Video Processing and Coding,
Academic Press, 2006
2. Dudgeon Dan E., Multidimensional Digital Signal Processing, Prentice Hall, Englewood
Cliffs, New Jersey, 1989
3. Jae S. Lim, Two- Dimensional Signal and Image Processing, Prentice Hall Englewood
Cliffs, New Jersey, 1990.
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 5 Hours
Digital Models For The Speech Signal: Process of speech production, Acoustic theory of speech
production, Lossless tube models, and Digital models for speech signals.
MODULE 2 7 Hours
Time Domain Models for Speech Processing: Time dependent processing of speech, Short time
energy and average magnitude, Short time average zero crossing rate, Speech vs silence
discrimination using energy & zero crossings, Pitch period estimation, Short time autocorrelation
function, Short time average magnitude difference function, Pitch period estimation using
autocorrelation function, Median smoothing.
MODULE 3 8 Hours
Digital Representations of the Speech Waveform: Sampling speech signals, Instantaneous
quantization, Adaptive quantization, Differential quantization, Delta Modulation, Differential
PCM, Comparison of systems, direct digital code conversion. Short Time Fourier Analysis:
Linear Filtering interpretation, Filter bank summation method, Overlap addition method, Design
of digital filter banks, Implementation using FFT, Spectrographic displays, Pitch detection,
Analysis by synthesis, Analysis synthesis systems.
MODULE 4 7 Hours
32
Homomorphic Speech Processing: Homomorphic systems for convolution, Complex cepstrum,
Pitch detection, Formant estimation, Homomorphic vocoder. Linear Predictive Coding of
Speech: Basic principles of linear predictive analysis, Solution of LPC equations, Prediction
error signal, Frequency domain interpretation, Relation between the various speech parameters,
Synthesis of speech from linear predictive parameters, Applications
MODULE 5 7 Hours
Speech Enhancement: Spectral subtraction & filtering, Harmonic filtering, parametric
re-synthesis, Adaptive noise cancellation. Speech Synthesis: Principles of speech synthesis,
Synthesizer methods, Synthesis of intonation, Speech synthesis for different speakers, Speech
synthesis in other languages, Evaluation, Practical speech synthesis.
MODULE 6 8 Hours
Automatic Speech Recognition: Introduction, Speech recognition vs. Speaker recognition, Signal
processing and analysis methods, Pattern comparison techniques, Hidden Markov Models,
Artificial Neural Networks. Audio Processing: Auditory perception and psychoacoustics -
Masking, frequency and loudness perception, spatial perception, Digital Audio, Audio Coding -
High quality, low-bit-rate audio coding standards, MPEG, AC- 3, Multichannel audio - Stereo,
3D binaural and Multichannel surround sound.
References:
1. L. R. Rabiner and R. W. Schafer, “Digital Processing of Speech Signals", Pearson
Education (Asia) Pte. Ltd., 2004.
2. D. O’Shaughnessy, “Speech Communications: Human and Machine”, Universities Press,
2001.
3. L. R. Rabiner and B. Juang, “Fundamentals of Speech Recognition”, Pearson Education
(Asia) Pte. Ltd., 2004.
4. Z. Li and M.S. Drew, “Fundamentals of Multimedia”, Pearson Education (Asia) Pte. Ltd.,
2004.
1)Laboratory : 30 %
2) Examination : 50 %
33
3) Course Work : 20 %
MODULE 1 6 Hours
Introduction: 2D systems, Mathematical preliminaries – Fourier Transform, Z Transform,
Optical & Modulation transfer function, Matrix theory, Random signals, Discrete Random fields,
Spectral density function.
MODULE 2 7 Hours
Image Perception: Light, Luminance, Brightness, Contrast, MTF of the visual system, Visibility
function, Monochrome vision models, Fidelity criteria, Color representation, Chromaticity
diagram, Color coordinate systems, Color difference measures, Color vision model, Temporal
properties of vision.
Image Sampling and Quantization: Introduction, 2D sampling theory, Limitations in sampling
& reconstruction, Quantization, Optimal quantizer, Compander, Visual quantization.
MODULE 3 7 Hours
Image Transforms: Introduction, 2D orthogonal & unitary transforms, Properties of unitary
transforms, DFT, DCT, DST, Hadamard, Haar, Slant, KLT, SVD transform.
Image Representation by Stochastic Models: Introduction, one-dimensional Causal models, AR
models, Non-causal representations, linear prediction in two dimensions.
MODULE 4 7 Hours
Image Enhancement: Point operations, Histogram modeling, spatial operations, Transform
operations, Multispectral image enhancement, false color and Pseudo-color, Color Image
enhancement.
Image Filtering & Restoration: Image observation models, Inverse & Wiener filtering, Fourier
Domain filters, Smoothing splines and interpolation, Least squares filters, generalized inverse,
SVD and Iterative methods, Maximum entropy restoration, Bayesian methods, Coordinate
transformation & geometric correction, Blind de-convolution.
MODULE 5 8 Hours
Image Analysis & Computer Vision: Spatial feature extraction, Transform features, Edge
detection, Boundary Extraction, Boundary representation, Region representation, Moment
representation, Structure, Shape features, Texture, Scene matching & detection, Image
segmentation, Classification Techniques.
Image Reconstruction from Projections: Introduction, Radon Transform, Back projection
operator, Projection theorem, Inverse Radon transform, Fourier reconstruction, Fan beam
reconstruction, 3D tomography.
Image Data Compression: Introduction, Pixel coding, Predictive techniques, Transform coding,
Inter-frame coding, coding of two tone images, Image compression standards.
MODULE 6 7 Hours
Video Processing: Fundamental Concepts in Video – Types of video signals, Analog video,
Digital video, Color models in video, Video Compression Techniques – Motion compensation,
34
Search for motion vectors, H.261, H.263, MPEG I, MPEG 2, MPEG 4, MPEG 7 and beyond,
Content based video indexing.
References:
1. K. Jain, “Fundamentals of Digital Image Processing”, Pearson Education (Asia) Pte.
Ltd./Prentice Hall of India, 2004.
2. Z. Li and M.S. Drew, “Fundamentals of Multimedia”, Pearson Education (Asia) Pte. Ltd.,
2004.
3. R. C. Gonzalez and R. E. Woods, “Digital Image Processing”, 2nd edition, Pearson
Education (Asia) Pte. Ltd/Prentice Hall of India, 2004.
4. M. Tekalp, “Digital Video Processing”, Prentice Hall, USA, 1995
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 10 Hours
Fundamentals of Multirate Theory: The sampling theorem - sampling at sub nyquist rate -
Basic Formulations and schemes. Basic Multirate operations- Decimation and Interpolation -
Digital Filter Banks- DFT Filter Bank- Identities- Polyphase representation Maximally
decimated filter banks: Polyphase representation - Errors in the QMF bank- Perfect
reconstruction (PR) QMF Bank - Design of an alias free QMF Bank.
MODULE 2 10 Hours
M-channel perfect reconstruction filter banks: Uniform band and non uniform filter bank -
tree structured filter bank- Errors created by filter bank system- Polyphase representation- perfect
reconstruction systems.
MODULE 3 12 Hours
Perfect reconstruction (PR) filter banks: Paraunitary PR Filter Banks- Filter Bank Properties
induced by paraunitarity- Two channel FIR paraunitary QMF Bank- Linear phase PR Filter
35
banks- Necessary conditions for Linear phase property- Quantization Effects: -Types of
quantization effects in filter banks. - coefficient sensitivity effects, dynamic range and scaling.
MODULE 4 10 Hours
Cosine Modulated filter banks: Cosine Modulated pseudo QMF Bank- Alas cancellation-
phase - Phase distortion- Closed form expression, Polyphase structure- PR Systems.
References:
1. P.P. Vaidyanathan, “Multirate systems and filter banks”, Prentice Hall. PTR. 1993.
2. N.J. Fliege, “Multirate digital signal processing” John Wiley.
3. Fredric J. Harris, “Multirate Signal Processing for Communication Systems”, Prentice
Hall, 2004
4. Ljiljana Milic, “Multirate Filtering for Digital Signal Processing: MATLAB
Applications”, Information Science Reference; 1/e, 2008
5. Sanjit K. Mitra, “Digital Signal Processing: A computer based approach”, McGraw Hill.
1998.
6. R.E. Crochiere. L. R. Rabiner, “Multirate Digital Signal Processing”, Prentice Hall.
Inc.1983.
7. J.G. Proakis. D.G. Manolakis, “Digital Signal Processing: Principles. Algorithms and
Applications”, 3rd Edn. Prentice Hall India, 1999
Optimization Techniques
3-0-0
Learning Outcomes:
The course deals with the unconstrained and nonlinear constraint optimization techniques, and
an introduction to graph theory and combinatorial optimization.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 10 Hours
Unconstrained optimization: - Necessary and sufficient conditions for local minima, one
dimensional search methods, gradient methods - steepest descent, Inverse Hessian, Newton’s
method, conjugate direction method, conjugate gradient algorithm, quasi Newton methods
MODULE 2 12 Hours
36
Linear Programming: - Convex polyhedra, standard form of linear programming, Basic
solutions, Simplex algorithm, Matrix form of the simplex algorithm, Duality, non simplex
methods : Khachiyan method, Karmarkar’s method
MODULE 3 10 Hours
Nonlinear Constrained Optimization: - equality constraints – Lagrange multipliers, inequality
constraints – Kuhn-Tucker conditions, Convex optimization, Geometric programming, Projected
gradient methods, Penalty methods
MODULE 4 10 Hours
Introduction to graph theory and combinatorial optimization:- Routing-traveling salesman;
Assignment – satisfiability, constraint satisfiability, graph coloring; Subsets- set covering,
partitioning; Scheduling; Shortest path and Critical path algorithms
References:
1. Edwin K. P. Chong, Stanislaw H. Zak, An Introduction to Optimization,2nd Ed, John
Wiley & Sons
2. Stephen Boyd, Lieven Vandenberghe, Convex Optimization, CUP, 2004.
3. R. Fletcher, Practical methods of Optimization, Wiley, 2000
4. Jonathan L Grosss, Jay Yellen, Chapmamn and Hall, Graph theory and its application, 2e,
CRC pub,
5. Alan Tucker, Applied Combinatorics, John wiley and Sons
Machine Learning
3-0-0
Learning Outcomes:
● Appreciation of basic knowledge about machine learning and its classification.
● Ability to understand the regression techniques, ensemble methods and graphical models.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 8 Hours
37
Introduction to machine learning. Classification: nearest neighbour, decision trees, perceptron,
support vector machines, VC-dimension.
MODULE 2 8 Hours
Regression: linear least squares regression, support vector regression. Additional learning
problems: multiclass classification, ordinal regression, ranking.
MODULE 3 8 Hours
Ensemble methods: boosting. Probabilistic models: classification, regression, mixture models
(unconditional and conditional), parameter estimation, EM algorithm.
MODULE 4 10 Hours
Beyond IID, directed graphical models: hidden Markov models, Bayesian networks. Beyond IID,
undirected graphical models: Markov random fields, conditional random fields.
MODULE 5 8 Hours
Learning and inference in Bayesian networks and MRFs: parameter estimation, exact inference
(variable elimination, belief propagation), approximate inference (loopy belief propagation,
sampling). Additional topics: semi-supervised learning, active learning, structured prediction.
References:
1. Bishop. C M, Pattern Recognition and Machine Learning. Springer, 2006.
2. Duda, R O, Hart P E and Stork DG. Pattern Classification. Wiley-Interscience, 2nd
Edition, 2000.
3. Hastie T, Tibshirani R and Friedman J, The Elements of Statistical Learning: Data
Mining, Inference and Prediction. Springer, 2nd Edition, 2009.
4. Mitchell T, Machine Learning. McGraw Hill, 1997.
Soft Computing
3-0-0
Learning Outcomes:
● Appreciation of the unified and exact mathematical basis as well as the general principles
of various soft computing techniques.
● Appreciation of basic knowledge about the theory and key algorithms that form the
foundation for artificial neural network and practical knowledge of learning algorithms
and methods
● Appreciation of basic knowledge about the theory and key algorithms that form the
foundation for fuzzy logic and become aware of the use of fuzzy inference systems in the
design of intelligent or humanistic systems.
38
● Ability to understand the principles, advantages, limitations and possible applications of
learning.
● Ability to identify and apply the appropriate learning technique to classification, pattern
recognition, optimization and decision problems.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 7 Hours
Overview of course and Basic of Soft Computing, Introduction of Neural Networks
MODULE 2 8 Hours
Learning Process and Learning Task, Supervised Learning – Single and Multi Layer Network,
Associative Memory, Self organizing Maps, Neuro-Dynamics, Hopfield Network
MODULE 3 12 Hours
Fuzzy Logic and Systems-Fuzzy Sets and Membership Functions, Operations on Fuzzy Sets,
Fuzzification. Fuzzy Numbers- Uncertain Fuzzy Values, Fuzzy Numbers and its L-R
representation, Operations on Fuzzy Numbers
MODULE 4 8 Hours
Fuzzy Relations, Fuzzy Inference Systems- Architecture of Fuzzy Inference System, Fuzzy
Inference Rules and Reasoning, Defuzzification, Applications of Fuzzy Logic
MODULE 5 7 Hours
Genetic algorithms and evolutionary computation, Applications of Genetic Algorithms & Hybrid
Systems
References:
1. Soft Computing and Its Applications : R.A. Aliev, R.R. Aliev
2. Neuro-Fuzzy and Soft Computing: A computational Approach to Learning & Machine
Intelligence; Roger Jang, Tsai Sun, Eiji Mizutani, PHI.
3. Neural Network: A Comprehensive Foundation; Simon Haykin, PHI.
4. Elements of artificial Neural Networks; Kishan Mehtrotra, S. Ranka, Penram
International Publishing (India).
5. Fuzzy Logic with Engineering Applications; Timothy Ross, McGraw-Hill.
6. Neural Networks and Fuzzy Systems: Bar Kosko , PHI.
39
Learning Outcomes:
1. Understand VLSI design methodology for signal processing systems.
2. Be familiar with VLSI algorithms and architectures for DSP.
3. Be able to implement basic architectures for DSP using CAD tools.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 10 hours
Pipelining and Parallel Processing: Introduction, Pipelining of FIR Digital Filters, Parallel
Processing. Pipelining and Parallel Processing for Low Power. Retiming: Introduction,
Definition and Properties, Solving System of Inequalities, Retiming Techniques.
MODULE 2 12 hours
Unfolding: Introduction and Algorithms for Unfolding, Properties of Unfolding, Critical Path,
Unfolding and Retiming Application of Unfolding. Folding: Introduction to Folding
Transformation, Register Minimization Techniques, Register Minimization in Folded
Architectures, Folding in Multirate Systems.
MODULE 3 10 hours
Systolic Architecture Design: Introduction, Systolic Array Design Methodology, FIR Systolic
Arrays, Selection of Scheduling Vector, Matrix Multiplication and 2D Systolic Array Design,
Systolic Design for Space Representations Containing Delays.
MODULE 4 10 hours
Fast Convolution: Introduction, Cook, Toom Algorithm, Winogard Algorithm, Iterated
Convolution, Cyclic Convolution, Design of Fast Convolution Algorithm by Inspection.
References:
1. Keshab K. Parhi. VLSI Digital Signal Processing Systems, Wiley-InterSciences, 1999
2. Mohammed Ismail, Terri, Fiez, Analog VLSI Signal and Information Processing,
McGraw Hill, 1994.
3. Kung. S.Y., H.J. While house T.Kailath, VLSI and Modern singal processing, Prentice
Hall, 1985.
4. Jose E. France, YannisTsividls, Design of Analog Digital VLSI Circuits for
Telecommunications and Signal Processing’ Prentice Hall, 1994.
40
Biomedical Signal Processing
3-0-0
Learning Outcomes:
1. Understand biomedical for signal processing systems.
2. Be familiar with EEG, ECG,EMG.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 10 Hours
Introduction: Genesis and significance of bioelectric potentials, ECG, EOG, EMG and their
monitoring and measurement, Spectral analysis, digital and analog filtering, correlation and
estimation techniques, AR / ARMA models, Adaptive Filters.
MODULE 2 12 Hours
ECG: Pre-processing, Measurements of amplitude and time intervals, Classification, QRS
detection, ST segment analysis, Baseline wander removal, waveform recognition, morphological
studies and rhythm analysis, automated diagnosis based on decision theory ECT compression,
Evoked potential estimation.
MODULE 3 10 Hours
EEG: evoked responses, Epilepsy detection, Spike detection, Hjorth parameters, averaging
techniques, removal of Artifacts by averaging and adaptive algorithms, pattern recognition of
alpha, beta, theta and delta waves in EEG waves, sleep stages,
MODULE 4 10 Hours
EMG: wave pattern studies, biofeedback, Zero crossings, Integrated EMG. Time frequency
methods and Wavelets in Biomedical Signal Processing
References:
1. Willis J Tompkins, ED, “Biomedical Digital Signal Processing”, Prentice-Hall of India,
1996.2.
2. R E Chellis and R I Kitney, “Biomedical Signal Processing”, in IV parts, Medical and
Biological Engg. And current computing, 1990-91.
3. Special issue on “Biological Signal Processing”, Proc. IEEE 1972
4. Arnon Kohen, “Biomedical Signal Processing”, Volumes I & II, CRC Press.
41
5. Metin Aray, “Time frequency and Wavelets in Biomedical Signal Processing”, IEEE
Press, 1999.Current Published literature.
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 7 Hours
Planar Antennas - Microstrip rectangular and circular patch antennas- Analysis and design,
feeding methods, circularly polarized microstrip antennas, Broadbanding techniques, and printed
slot antennas.
MODULE 2 7 Hours
Array Theory – Linear array; Broadside and end fire arrays; Self and mutual impedance of
between linear elements, grating lobe considerations
MODULE 3 7 Hours
Planar array- Array factor, beamwidth, directivity. Example of microstrip patch arrays and feed
networks, Electronic scanning
MODULE 4 7 Hours
Broadband Antennas- Folded dipole, Sleeve dipole, Biconical antenna- Analysis, characteristics,
matching techniques, Yagi array of linear elements and printed version, Log-periodic dipole
array. Frequency Independent Antennas- Planar spiral antenna, Log periodic dipole array.
MODULE 5 7 Hours
Aperture Antennas- Field equivalence principle, Babinet’s principle, Rectangular waveguide,
horn antenna, parabolic reflector antenna
MODULE 6 7 Hours
Antennas for mobile communication - Handset antennas, Base station antennas. Beam steering
and antennas for MIMO applications; Active and smart microstrip antennas, Design and analysis
of microstrip antenna arrays
42
References:
1. C. A. Balanis, Antenna Theory and Design, John Wiley & Sons, 1997.
2. J.D. Kraus, Antennas, McGraw-Hill, 1988
3. R.A. Sainati, CAD of Microstrip Antennas for Wireless Applications, Artech House,
1996.
4. R. Garg, P. Bharhia, I. Bahl, and A. Ittipiboo, Microstrip Antenna design Handbook,
Artech House.
5. J. R. James, P.S. Hall and C.Wood, Microstrip Antennas: Theory & Design, Peter
Peregrinns , UK
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 12 Hours
Fundamentals of VLSI testing: Basic of VLSI testing, Scope of testing and verification in VLSI
design process, Issues in test and verification of complex chips, embedded cores and SOCs.
MODULE 2 12 Hours
Fault Modeling and testing: Fault models, fault detection and redundancy, fault equivalence and
fault location, fault dominance, automatic test pattern generation, Design for testability, Scan
design, Test interface and boundary scan. System testing and test for SOCs. Delay fault testing.
MODULE 3 10 Hours
Test automation and Design verification: BIST for testing of logic and memories, Test
automation, Design verification techniques based on simulation, analytical and formal
approaches.
MODULE 4 8 Hours
Functional and Timing verification: Functional verification, Timing verification, Formal
verification, Basics of equivalence checking and model checking, Hardware emulation.
43
References:
1. M. Abramovici, M. A. Breuer and A. D. Friedman, Digital Systems Testing and Testable
Design, Jaico Publishing House, 1990.
2. T. Kropf, Introduction to Formal Hardware Verification, Springer Verlag, 2000.
3. Neil H. E. Weste and Kamran Eshraghian, Principles of CMOS VLSI Design, Addison
Wesley, Second Edition, 1993.
4. Neil H. E. Weste and David Harris, Principles of CMOS VLSI Design, Addison Wesley,
Third Edition, 2004.
5. M. Bushnell and V. D. Agrawal, Essentials of Electronic Testing for Digital, Memory and
Mixed Signal VLSI Circuits, Kluwer Academic Publishers, 2000.
VLSI Technology
3-0-0
Learning Outcomes:
This course aims at understanding the manufacturing methods and their underlying scientific
principles in the context of technologies used in VLSI chip fabrication.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 12 Hours
Crystal Growth, Wafer manufacturing and Clean rooms: CMOS Process flow starting from
Substrate selection to multilevel metal formation, comparison between bulk and SOI CMOS
technologies. Crystal structure, Czochralski and FZ growth methods, Wafer preparation and
specifications, SOI Wafer manufacturing, Clean rooms, wafer cleaning and gettering: Basic
concepts, manufacturing methods and equipment, Measurement methods.
MODULE 2 10 Hours
Photolithography and Oxidation:
Photolithography: Light sources, Wafer exposure systems, Photoresists, Baking and
development, Mask making, Measurement of mask features and defects, resist patterns and
etched features.
Oxidation: Wet and Dry oxidation, growth kinetics and models, defects, measurement methods
and characterization.
MODULE 3 8 Hours
Diffusion and Ion-implantation:
44
Diffusion: Models for diffused layers, Characterization methods, Segregation, Interfacial dopant
pileup, oxidation enhanced diffusion, dopant-defect interaction.
Ion-implantation: Basic concepts, High energy and ultralow energy implantation, shallow
junction formation & modeling, Electronic stopping, Damage production and annealing, RTA
Process & dopant activation
MODULE 4 12 Hours
Thin film Deposition, Etching Technologies and Back-end Technology:
Thin film Deposition: Chemical and physical vapour deposition, epitaxial growth,
manufacturing methods and systems, deposition of dielectrics and metals commonly used in
VLSI, Modeling deposition processes.
Etching Technologies: Wet etching, Plasma etching, RIE, Etching of materials used in VLSI,
Modeling of etching,
Back-end Technology: Contacts, Vias, Multi-level Interconnects, Silicided gates and S/D
regions, Reflow & planarization, Multi-chip modules and packaging.
References:
1. James Plummer, M. Deal and P.Griffin, Silicon VLSI Technology, Prentice Hall
Electronics, 2000.
2. Stephen Campbell, The Science and Engineering of Microelectronics, Oxford University
Press, 1996.
3. S. M. Sze (Ed), VLSI Technology, McGraw Hill, Second Edition, 1988.
4. S.K. Gandhi, VLSI Fabrication Principles, John Wiley Inc., New York, 1983.
5. C.Y. Chang and S. M. Sze (Ed), ULSI Technology, McGraw Hill Companies Inc, 1996.
Microwave Imaging
3-0-0
Learning Outcomes:
The course helps students in understanding electromagnetic scattering, electromagnetic inverse
scattering problem, imaging configurations and model approximations. Various qualitative
reconstruction methods and imaging techniques are discussed.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
45
MODULE 1 8 Hours
Electromagnetic Scattering: Maxwell's equation, interface conditions, constitutive equations,
Wave Equations and Their Solutions, Volume Scattering by Dielectric Targets, Volume
Equivalence Principle, Integral Equations, Surface Scattering by Perfectly Electric Conducting
Targets.
MODULE 2 6 Hours
Electromagnetic Inverse Scattering Problem: Two-Dimensional Inverse Scattering,
Discretization of the Continuous Model, Scattering by Canonical Objects: The Case of
Multilayer Elliptic Cylinders
MODULE 3 8 Hours
Imaging Configurations and Model Approximations: Objectives of the Reconstruction, Multi
illumination Approaches, Tomographic Configurations, Scanning Configurations, Configurations
for Buried-Object Detection, Born-Type Approximations, Extended Born Approximation, Rytov
Approximation, Kirchhoff Approximation.
MODULE 4 8 Hours
Qualitative Reconstruction Methods: Generalized Solution of Linear Ill-Posed Problems,
Regularization Methods, Singular Value Decomposition, Regularized Solution of a Linear
System Using Singular Value Decomposition, Qualitative Methods for Object Localization and
Shaping, Synthetic Focusing Techniques, Qualitative Methods for Imaging Based on
Approximations.
MODULE 5 6 Hours
Imaging Techniques: Back projection, w-k, beamforming, synthetic aperture imaging, Kirchoff
method
MODULE 6 6 Hours
Microwave Imaging Apparatuses, Systems and Applications: Scanning Systems for
Microwave Tomography, Antennas for Microwave Imaging, Civil and Industrial Applications,
Medical Applications of Microwave Imaging, Shallow Subsurface Imaging.
References:
1. V. C. Chen and H. Ling, “Time-Frequency Transforms for Radar Imaging and Signal
Analysis”, Artech House 2002
2. Bernard D. Steinberg, “Microwave Imaging Techniques”, Wiley & Sons 1991
3. Taylor, D.J., “Introduction to Ultra-wideband Radar Systems”, CRC Press. 1995
4. D. R. Wehner, “High-Resolution Radar”, 2nd Ed.,, Artech House 1994
46
Microwave Measurements
3-0-0
Learning Outcomes:
● Gain proficiency regarding microwave circuit concepts and relation between different
parameters.
● Design impedance matching networks and familiarity with passive microwave
components. Design of basic microwave laboratory set up along with measurement of
parameters. Knowledge of VNA will help in the measurement of S parameters of
different microwave devices.
● Familiarity with VNA concept can be used for finding gain, phase, reflection and
transmission coefficient etc.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 8 Hours
Introduction to microwave circuit concepts, Relation between [s], [z], [y] parameter
MODULE 2 10 Hours
Microwave circuits & theorems, Impedance matching, Passive microwave components
MODULE 3 14 Hours
Measurement of Wavelength, Frequency and Impedance-Introduction, Equivalent circuit of
Cavity wave meters, Typical wave meters, resonant cavities, Methods of frequency
measurements direct method - Interpolation method, Standard wave reflectors, Measurement of
reflection coefficient, Low, Medium, High VSWR measurements, Standing wave pattern, Slotted
Line section and its limitation, Impedance measurement techniques, Reflectometer
MODULE 4 10 Hours
Vector Network analyzer, Concept and description, Reflection and Transmission measurements,
magnitude and Phase, measurement of S- Parameters, SWR and Impedances measurements,
errors and corrections
47
References:
1. Microwave circuit, By J.L. Altmen, D van Nostrand Co.,Inc.
2. Foundations for microwave engineering, By R. E. Collins., John Wiley & Sons
3. Microwave Circuit Theory and Analysis, By R. N. Ghosh, McGraw Hill
1) Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 14 Hours
Communication Networks: LANs, MANs, WANs, Switching techniques, Wireless ATM
networks, TCP/IP protocol architecture, OSI protocol architecture, Internetworking Wireless
Communication Technology: Propagation modes, LOS transmission, Fading in the mobile
environment. Signal encoding: Criteria, Digital data-analog signals, Analog data-Analog signals,
Analog data-Digital signals. Coding and Error Control: Error detection, Block error correction
codes, convolution codes, Automatic repeat request
MODULE 2 14 Hours
Cellular Wireless Networks - Principles of cellular network, first, second and third Generation
systems. Cordless Systems and WLL: Cordless systems, Wireless Local Loop, IEEE 802.16
fixed broadband wireless access standard. Mobile IP and wireless Access Protocol: Mobile IP,
Wireless Application Protocol, Internet control message protocol, Message authentication,
Service primitives and parameters.
MODULE 3 14 Hours
Wireless LAN Technology: Overview, Infrared LANs, Spread spectrum LANs, Narrowband
microwave LANs. IEEE 802.11 Wireless LAN: IEEE 802 protocol architecture, IEEE 802.11
architecture and services, IEEE 802.11 MAC, IEEE 802.11 physical layer. Bluetooth: Overview,
Radio specification, baseband specification, Link manager specification, Logical Link control
and adaptation protocol.
References:
48
1. Wireless Communications & Networks, by William Stallings, 2 Edition, 2009, and
Pearson Education.
2. Wireless communication and Networking by V.K. Garg, Morgan Kauffman Publisher,
2009.
3. Wireless Communication & Network, 3G & beyond, by Iti Saha Misra, McGrawHill,
2009.
Satellite Communication
3-0-0
Learning Outcomes:
This course aims at providing thorough information of the conventional and upcoming satellite
communication technology. The course covers the fundamental aspects of satellite
communications like orbital theory and link budget analysis. The course would be taught from a
physical layer signal processing point‐of‐view and it would cover teaching of famous channel
models of the land mobile satellite (LMS) links and also some recently discovered channel
models. The multiple antennas based satellite communication would also be explained. The
hybrid satellite‐terrestrial satellite communication technology would also be introduced.
Assessment Criterion
1)Laboratory : 30 %
2) Examination : 50 %
3) Course Work : 20 %
MODULE 1 5 Hours
Introduction to satellite communication and orbital theory
MODULE 2 8 Hours
Satellite antennas, Satellite link design
MODULE 3 12 Hours
Channel models for satellite links, Modulation, multiple access techniques for satellite
communication, and VSAT
MODULE 4 6 Hours
Introduction to MIMO systems and error analysis
MODULE 5 13 Hours
Multiple antenna based satellite communication, Hybrid satellite‐terrestrial communication
system
References:
49
1. T. Pratt, C. Bostian, and J. Allnutt, Satellite Communications, 2nd ed.John Wiley & Sons,
2003.
2. K. Y. Jo, Satellite Communications Network Design and Analysis,ARTECH HOUSE,
2011.
3. Recent research papers on MIMO satellite and hybrid satellite‐terrestrial communication
4. E. G. Larsson and P. Stoica, Information Theory, Space‐Time Block Coding for Wireless
Communications, Cambridge University Press, 2003.
50