DETAILED SYLLABUS

Cash Flow Statement, Balance Sheet Connections. Sales Cycle, Expense Cycle, Investment
Cycle, Asset Purchase & Depreciation Cycle.
TEXT BOOKS

1. Robert N. Anthony, David F. Hawkins and Kenneth A.Mechant: Accounting-Text and
Cases, 12/e TMH, 2008.

2. Narayanaswamy, R., Financial Accounting: A Managerial Perspective, PHI 2008.
REFERENCE BOOKS

1. Gokul Sinha: Financial Statement Analysis, PHI, 2009.
2. Ambrish Gupta: Financial Accounting Management an Analytical Perspective, Pearson

Education.
3. Jawaharlal: Accounting for Management, HPH, 2008.
4. Stice & Stice: Financial Accounting Reporting & Analysis. Cengage, 7/e, 2008.
5. Horngren: Financial Accounting, Pearson, 2009.

51

ELECTROMAGNETIC WAVES AND TRANSMISSION LINES

Year Semester Hours/Week C Marks Total
L T P/D CIE SEE

II II 4 - 2 5 40 60 100

Pre-requisite Mathematics

COURSE OUTCOMES
At the end of the course the student will be able to:

1. Describe the physical concepts of static electric fields.
2. Explain the physical concepts of static magnetic fields.
3. Apply the Maxwell equations in electromagnetic field theory.

4. Analyze the boundary conditions for different mediums i.e. dielectric to dielectric, dielectric to

conductor interfaces.

5. To get solutions to the transmission line equations and estimate power in conductors using

pointing theorem.

UNIT I Electrostatics
Divergence theorem, Stokes’s theorem, Coulomb’s Law, Electric Field Intensity – Fields due to

Different Charge Distributions, Electric Flux Density, Gauss Law and Applications, Electric
Potential, Relations Between E and V, Maxwell’s Two Equations for Electrostatic Fields,

Energy Density, Illustrative Problems. Convection and Conduction Currents, Dielectric
Constant, Continuity Equation, Poisson’s and Laplace’s Equations, Illustrative Problems.

UNIT II Magnetostatics
Biot-Savart’s Law, Ampere’s Circuital Law and Applications, MagneticFlux Density, Maxwell’s Two

Equations for Magnetostatic Fields, Magnetic Scalar and Vector Potentials, Lorentz force equation,

Forces due to Magnetic Fields, Illustrative Problems
UNIT III Maxwell’s Equations (Time Varying Fields)
Faraday’s Law and Transformer emf, Displacement Current Density and Maxwell-Ampere
law, Maxwell’s Equations , Potential functions, Conditions at a Boundary Surface: Dielectric-

Dielectric, Dielectric-Conductor, Interfaces, Illustrative Problems.

UNIT IV EM Wave Characteristics
Wave Equations for Conducting and Perfect Dielectric Media, Uniform Plane Waves –

Definition, Sinusoidal Variations ,Wave Propagation in Lossless and Conducting Media, Group
velocity, Conductors and Dielectrics –Characterization, Wave Propagation in Good Conductors and

Good Dielectrics, , Electromagnetic power flow and Poynting Theorem, Illustrative Problems.

UNIT V Transmission Lines

Transmission Line Equations, Line of zero dissipation, Voltage and current on the dissipationless line,

standing waves and standing wave ratio, Primary and Secondary Constants, Expressions for

Characteristic Impedance, Propagation Constant, Reflection Coefficient, VSWR, UHF Lines as
Circuit Elements, λ/4, λ2, λ/8 Lines – Impedance Transformations, Single and double stub matching

using Smith Chart ,Illustrative Problems.

TEXT BOOKS
1. Matthew N.O. Sadiku, “Elements of Electromagnetics”, 4th Edition, Oxford University
Press, 2008.
2. Umesh Sinha, Satya Prakashan, “Transmission Lines and Networks”, Tech
India Publications, New Delhi, 2001.

REFERENCE BOOK
1. E.C. Jordan and K.G. Balmain, “Electromagnetic Waves and Radiating Systems”,

2nd Edition, PHI, 2000.

52

2. William H. Hayt Jr. and John A. Buck, “Engineering Electromagnetics”, 7th
Edition, TMH, 2006.

3. John D. Ryder, “Networks, Lines and Fields”, 2nd Edition, PHI, 1999.
4. Nathan Ida, “Engineering Electromagnetics”, 2nd Edition, Springer (India) Pvt. Ltd.,

New Delhi, 2005.

53

CONTROL SYSTEMS
(CORE SPECIALIZATION-ECE)

Year Semester Hours/Week C Marks Total
L T P/D CIE SEE

III I 3 - 2 4 40 60 100

Pre-requisite Mathematics

COURSE OUTCOMES
At the end of the course, students will be able to:
1. Apply various mathematical principles (from calculus and linear algebra) to solve control system

problems.
2. Obtain mathematical models and derive transfer functions for mechanical, electrical, and

electromechanical systems.
3. Perform time domain and frequency domain analysis for a given system.
4. Design controllers and compensators for the suitable applications.
5. Analyze the system’s stability using state space approach.

UNIT I

Introduction and Transfer Function Representation

Concepts of Control Systems- Open Loop and closed loop control systems and their
differences- Feed-Back Characteristics, Effects of feedback. Mathematical models –

Differential equations and Transfer functions - Translational and Rotational mechanical

systems. Transfer Function of DC Servo motor - AC Servo motor- Block diagram
representation of systems -Block diagram algebra – Representation by Signal flow graph -
Reduction using Mason’s gain formula.

UNIT II

Time Response Analysis
Standard test signals - Time response of first order systems – Characteristic Equation of

Feedback control systems, Transient response of second order systems - Time domain
specifications – Steady state response - Steady state errors and error constants – Effects of

proportional derivative, proportional integral systems (P, PI, PID controllers).

UNIT III
Stability Analysis in Time Domain
The concept of stability – Routh’s stability criterion– limitations of Routh’s stability. The
root locus concept - construction of root loci-effects of adding poles and zeros to G(s)H(s) on
the root loci.

UNIT IV
Stability Analysis in Frequency Domain
Introduction to frequency domain analysis, Frequency domain specifications-Bode diagrams-
Determination of frequency domain specifications and transfer function from the Bode
Diagram-Phase margin and Gain margin-Stability Analysis from Bode Plots, Polar Plots,

54

Nyquist Plots and.Elementary concepts of Compensation techniques (Lag, Lead, Lead-Lag
Controllers).
UNIT V
State Space Analysis of Continuous Systems
Concepts of state, state variables and state model, derivation of state models from block
diagrams, Diagonalization- Solving the Time invariant state Equations- State Transition
Matrix and its Properties – Concepts of Controllability and Observability.
TEXTBOOKS:
1. Norman S Nise, “Control Systems Engg.”, 4th ed., John wiley Publishers, 2007, ISBN: 81-

265-1097-8, 978-81-265-1097-9.
2. Katsuhiko Ogata, “Modern Control Engineering”, 3rd ed., Prentice Hall of India Pvt. Ltd.,

1998.
REFERENCE BOOKS:
1. I. J. Nagrath and M. Gopal, “Control Systems Engineering”, 5th ed., New Age

International (P) Limited, Publishers, 2009.
2. B. C. Kuo, “Automatic Control Systems”, 9th edition, John wiley and son’s, 2014.
3. Narciso F. Macia George J. Thaler, “Modelling & Control of Dynamic Systems”,

Thomson Publishers.
4. N.K.Sinha, “Control Systems”, 3rd ed., New Age International (P) Limited Publishers,

1998, ISBN: 81-224-1168-1.

55

EMBEDDED PRODUCT DESIGN
(CORE SPECIALIZATION-IoT)

Year Semester Hours/Week C Marks Total
L T P/D CIE SEE

III I 3 - 2 4 40 60 100

Pre-requisite Smart System Design

Unit-I Introduction
Definition and Need/Relevance of PCB, Types of PCB, Classes of PCB Design,
Terminology in PCB Design, Introduction to different Electronic design automation (EDA)
tools. Simulate the simple RC circuit with different C values. Analyze the time constants
Unit-II PCB Design Flow
PCB design flow, placement and routing, Steps involved in layout design. Artwork
generation methods – manual and CAD, Layout and artwork making for single-side
Design-specification standards
Unit-III PCB Fabrication
Introduce single side PCB fabrication technique. Perform chemical etching, Introduce
soldering techniques. Drill the holes on PCB board.
Unit-IV PCB Soldering
Wiring on to PCB’s using soldering, Checking connectivity and circuit testing.
Troubleshoot any errors. Compare simulated vs experimental values
Unit-V Course Project
Students as a group need to present their circuit, Show visual and oral demonstration, Open
to all students

TEXT BOOKS
1. Printed Circuit Boards: Design - Fabrication Hardcover – 1 July 2017 R S
Khandpur
2. Printed Circuit Boards: Design and Technology Paperback – 16 June 1983 by
Walter Bosshart

3. Generation of Precision Artwork for Printed Circuit Boards Front Cover Preben
Lund

REFERENCE BOOK
1. Practical Circuit Design and Analysis by Michael F. Robbins
2. Master the analysis and design of electronic systems with CircuitLab's free,
interactive, online electronics textbook.
3. Printed Circuits Handbook, Sixth Edition Clyde F. Coombs, Jr.
4. Printed Circuit Assembly Manufacturing Front Cover Kear

56

MACHINE LEARNING AND ITS ALGORITHMS
(CORE SPECIALIZATION-AI ML)

Year Semester Hours/Week Marks Total
C CIE SEE

L T P/D

III I 3 - 2 4 40 60 100

Pre-requisite Artificial Intelligence, Mathematics

COURSE OUTCOME
At the end of the course the student will be able to:

1. To understand the basics of machine learning
2. To familiarize with regression, classification and optimization problems
3. To provide an idea about the NN Learning and SVM
4. To familiarize with factors to keep in mind while systems design
UNIT I
Introduction: Introduction to learning, Supervised Learning, Unsupervised Learning,
Reinforcement Learning. Linear Regression with One Variable - idea of cost function, and
gradient descent method for learning, Linear Regression with Multiple Variables- Multiple
Features, Gradient Descent for Multiple Variables, Feature Scaling, Learning Rate, Normal
Equation Noninvertibility, Features and Polynomial Regression, Logistic Regression-
classification, hypothesis representation, decision boundary, cost function, optimization,
multiclass classification.
UNIT II
Neural Network learning and SVM: Non-linear hypotheses, model representation,
multiclass classification. Learning-cost function, back propagation algorithm, unrolling
parameters, gradient checking, random initialization. SVM: introduction, optimization
objective, large margin classification, kernels
UNIT III
Unsupervised Learning: Introduction, k-means algorithm, optimization, random
initialization, clustering. Dimensionality Reduction: Data compression, visualization,
principal component analysis algorithm, reconstruction from compressed representation.
UNIT IV
Anomaly Detection and Recommender Systems: Gaussian distribution, algorithm for
anomaly detection, feature choosing, multivariate Gaussian distribution, Anomaly
Detection using the Multivariate Gaussian Distribution. Recommender Systems: content
based recommendations, collaborative filtering algorithm, vectorization and
normalizations.
UNIT V
Large Scale ML and ML System Design: Learning with large datasets, stochastic
gradient descent, mini-batch gradient descent, stochastic gradient descent convergence,
online learning, map reduce and data parallelism. System Design: performance of a
machine learning system, prioritizing, error analysis, error matrix for skewed classes,
trading off precision and recall, data for machine learning. Evaluating a Hypothesis, Model
Selection and Train/Validation/Test Sets, Diagnosing Bias vs. Variance, Regularization
and Bias/Variance, Learning Curves.

57

TEXT BOOK
1. Shai Shalev Shwartz, Shai Ben David, "Understanding Machine Learning: From
Theory to Algorithms", Cambridge University Press, 2014
2. Ethem_Alpaydin, “Introduction to Machine Learning”, Second Edition, MIT
Press, 2010
3. Tom_Mitchell, “Machine_Learning”, McGraw-Hill 1997
4. Kevin Murphy, “Machine learning: a Probabilistic Perspective”, MIT Press,
2012.
5. Shai Shalev Shwartz, Shai Ben David, "Understanding Machine Learning: From
Theory to Algorithms", Cambridge University Press, 2014

REFERENCES BOOK
1. Stuart J. Russell, "Artificial Intelligence 3e: A Modern Approach", Pearson
Education India; 3rd edition 2015
2. R.S.Michalski, J.G.Carbonell, T.M.Mitchell, “An Artificial Intelligence
Approach”, Springer-Verlag, 1984
3. Mehryar Mohri, Afshin Rostamizadeh and Ameet Talwalkar, "Foundations of
Machine Learning", MIT Press, 2012

58

ANALOG AND DIGITAL COMMUNICATIONS

Year Semester Hours/Week Marks
C CIE SEE Total

L T P/D

III I 4 - 2 5 40 60 100

Pre-requisite NIL

COURSE OUTCOMES
At the end of the course the student will be able to:

1. Analyze and design of various continuous wave and angle modulation and
demodulation techniques

2. Attain the knowledge about AM , FM Transmitters and Receivers
3. Analyze and design the various Pulse Modulation Techniques.
4. Describe the concepts of Digital Modulation Techniques.
UNIT I Introduction:
Block diagram of communication system, Need for modulation.
Amplitude Modulation:Amplitude Modulation - Time and frequency domain description,
Generation of AM wave -Switching modulator, Detection of AM Wave - Envelope
detector, Generation of DSBSC Wave : Balanced Modulators, Coherent detection of DSB-
SC, SSB modulation :Phase discrimination method of generating SSB wave, Detection of
SSB Wave, principle of Vestigial side band modulation.
UNIT II Angle Modulation
Frequency Modulation: Single tone Frequency modulation, Spectrum Analysis of
Sinusoidal FM Wave using Bessel functions, Constant Average Power, Transmission
bandwidth of FM Wave, Generation of FM Signal: Armstrong Method, Detection of FM
Signal: Phase locked loop.
UNIT III Transmitters and Receivers
Transmitters: AM Transmitters, FM Transmitters.
Receivers: AM and FM Super-heterodyne receivers.
UNIT IV Pulse Analog Modulation:

PAM, PWM and PPM (Qualitative information), TDM. Pulse Digital
Modulation: Block diagram of digital communication system, PCM Generation and

Reconstruction, DPCM, DM and Adaptive DM.
UNIT V Digital Modulations-Techniques:
Generation and detection of ASK, BPSK and BFSK, DPSK and QPSK.
Probability of error: Optimum Receiver for AWGN channel, Matched filter receiver,
probability of bit error computation for BPSK, BFSK, comparison of digital modulation
techniques.
TEXT BOOKS

1. Haykin S., "Communications Systems", John Wiley and Sons, 2001.
2. Proakis J. G. and Salehi M., "Communication Systems Engineering", Pearson

Education, 2002.
3. Digital Communications –Simon Haykin, Jon Whiley, 2005
4. Sam Shanmugam, “Digital and analog communication system”, John Wiley,

2005.
REFERENCE BOOK

1. Taub H. and Schilling D.L., "Principles of Communication Systems”, Tata
McGraw Hill, 2001.

59

2. Wozencraft J. M. and Jacobs I. M., ``Principles of
Communication Engineering'',John Wiley, 1965.

3. Barry J. R., Lee E. A. and Messerschmitt D. G., ``Digital Communication'',
Kluwer Academic Publishers, 2004.

4. Proakis J.G., ``Digital Communications'', 4th Edition, McGraw Hill, 2000.

60

MICROCONTROLLERS FOR EMBEDDED SYSTEMS

Year Semester Hours/Week Marks Total
C CIE SEE

L T P/D

III I 3 - 2 4 40 60 100

Pre-requisite NIL

COURSE OUTCOMES
At the end of the course the student will be able to:

1. Understand the architectures of microcontrollers
2. Describe the operation of timers
3. Analyze communication protocols
4. Comprehends the various real time operating systems
5. Interface various devices with microcontrollers
UNIT I Introduction
Introduction,8/16/32 bit microprocessors and controllers Microcontroller vs.
Microprocessor.
CORTEX-M0+ Processor Core
Microcontroller vs. Microprocessor, Cortex-M0+ Core, Architectures and Memory Speed,
Instruction Set, Modes for Addressing Memory, KL25Z GPIO Ports.
UNIT II C Code as Implemented in Assembly Language
Programmer’s World: The Land of Chocolate!, Processor’s World, Program Translation

Stages, Examining Assembly Code before Debugger, A Warning About Code
Optimizations, Application Binary Interface, Using Registers - AAPCS Register Use
Conventions, AAPCS Core Register, Memory requirements, accessing data in Memory.
UNIT III Interfacing Analog Interfacing
Analog to Digital conversion concepts, Digital to Analog Converter, Timers.
Serial Communication
Overview, Software Structure – Handling asynchronous Communication, Software
Structure – Parsing Messages, KL25Z and Freedom Specifics, Asynchronous serial
(UART) Communications, SPI Communications, I2C Communications, Protocol
Comparison
UNIT IV Interrupts
Exception and Interrupt Concepts - Example System with Interrupt, Example Program
Requirements & Design, Example Exception Handler, Types of interrupts, Interrupt
service routine (ISR).
UNIT V Embedded Systems Design
Introduction, Options for Building Embedded Systems, Example Embedded System:
Attributes of Embedded Systems, MCU Hardware & Software for Concurrency, Impact of
Constraints, Target Board - FRDM-KL25Z, CPU Scheduling, Scheduling Approaches,
Event-Triggered Scheduling using Interrupts, Static Schedule Example, Dynamic
Schedule, Common Schedulers – (Cyclic executive - non-preemptive and static, Run-To-
Completion Scheduler, Preemptive Scheduler) Task State and Scheduling Rules.
TEXT BOOKS

1. Embedded Systems Fundamentals on Arm Cortex-M based Microcontrollers: A
Practical Approach by Alexander G. Dean

2. The Designer's Guide to the Cortex-M Processor Family: A Tutorial Approach by
Trevor Martin

3. The Definitive Guide to the ARM Cortex-M0 by Joseph Yiu

61

4. The Definitive Guide to ARM® Cortex®-M3 and Cortex®-M4 Processors, Third
Edition by Joseph Yiu

REFERENCE BOOK
1. Joseph Yiu, “The definitive guide to ARM Cortex-M3”, Elsevier, 2ndEdition
2. Venkatramani B. and Bhaskar M. “Digital Signal Processors: Architecture,
Programming and Applications” , TMH , 2ndEdition
3. Sloss Andrew N, Symes Dominic, Wright Chris, “ARM System Developer's
Guide: Designing and Optimizing”, Morgan Kaufman Publication.
4. Steve furber, “ARM System-on-Chip Architecture”, Pearson Education
5. White Paper: Cortex-M for Beginners - An overview of the Arm Cortex-M
processor family and comparison
6. Technical references and user manuals on www.arm.com, NXP
Semiconductor www.nxp.com and Texas Instruments www.ti.com

62

DIGITAL SIGNAL PROCESSING

Year Semester Hours/Week Marks SEE Total
C CIE 50 100

L T P/D

III II 3 - - 3 50
Pre-requisite
Signals and Systems

COURSE OUTCOMES
At the end of the course, the student will develop the ability to

1. Represent signals mathematically in discrete-time and sketch its frequency
response
2. Compute DFT using Radix-2 FFT algorithms.
3. Design different types of digital filters in various domains.
4. Distinguish between the IIR and FIR filters.
5. Apply LMS algorithm for Adaptive filters

UNIT- I
Discrete Fourier Transform (DFT)
Classification of discrete-time systems, Introduction to Discrete-Time Fourier
Transform, Frequency domain representation of discrete-time systems, Computation of DFT,
Properties of DFT, Linear convolution, Circular convolution of sequences.

UNIT-II
Fast Fourier Transform (FFT): Derivation of Radix-2 FFT algorithms
: Decimation in Time, Decimation in Frequency, Inverse FFT, Comparison between DIT and
DIF FFT Algorithms.

UNIT- III
IIR Digital Filters
Analog filter approximations-Butterworth and Chebyshev, design of IIR digital filters from
analog filters: Impulse Invariant Techniques, Bilinear transformation method

UNIT- IV
FIR Digital Filters
Characteristics of FIR digital filters, frequency response, Design of FIR digital filters: Fourier
method, window techniques, Comparison of IIR and FIR filters.

UNIT- V
Realization of filters
Realization of IIR Digital Filters – Direct, Canonic, Cascade and Parallel forms. Realization
of FIR Digital Filters – Transversal Structure, Linear Phase Realization, Basic adaptive FIR
filter, Least Means Squares (LMS) algorithm

TEXTBOOKS
1. John G. Proakis and Dimitris G. Manolakis, “Digital Signal Processing,
principles, Algorithms and Applications”, Pearson Education / PHI, 4th Edition,
2007.
2. Mithra, “Digital Signal Processing”, McGraw Hill Publications.

63

REFERENCE BOOKS
1. Li Tan, “Digital Signal Processing- Fundamentals and Applications”, Elsevier,
2008.
2. Robert J. Schilling and Sandra L. Harris, “Fundamentals of Digital Signal
Processing Using Matlab”, Thomson, 2007.
3. Ramesh Babu P, “Digital Signal Processing”, SciTech, 4th Edition, 2013.
4. Digital Signal Processing using Arm Cortex-M based Microcontrollers:
Theory and
Practice https://www.arm.com/resources/education/textbooks/dsptextbook
5. Digital Signal Processing Using the ARM Cortex M4 Paperback by Donald S.
Reay

64

ANALOG AND DIGITAL COMMUNICATION LAB

Year Hours/Week P/D C Marks Total
Semester CIE SEE 100

LT

III I - - 3 1 50 50

Pre-requisite Signals & Systems

COURSE OUTCOMES:
At the end of the course the students will develop ability to

1. Design FM transmitter, Pre-emphasis and De-emphasis for given
specifications.
2. Analyse the operation of TDM and simulate using MATLAB.
3. Apply the knowledge of mathematics to find frequency domain characteristics
of Continuous wave modulated signals and Simulate using MATLAB.
4. Interpret the data of various Digital modulation schemes and simulate using
MATLAB
5. Analyse various Pulse modulation schemes and simulate using MATLAB.

LIST OF EXPERIMENTS: (Note: Minimum 12 experiments to be conducted)
All these experiments are to be simulated first either using Commsim, MATLAB,
SCILAB, OCTAVE or PYTHON any other simulation package and then to be realized in
hardware.

DEMONSTRATION
1. Amplitude modulation and demodulation.
2. DSB-SC Modulator & Detector
3. SSB-SC Modulator & Detector (Phase Shift Method)
4. Frequency modulation & demodulation.
5. Pulse Amplitude Modulation & De Modulation
6. Pulse position Modulation and De modulation.
7. Frequency division multiplexing
8. PCM generation and detection.
9. Delta modulation.
10. Time division multiplexing of four band limited signals.
11. Generation and detection of PSK and FSK.
12. QPSK: generation and detection.
13. Study of spectrum analyzer and analysis of AM and FM signals
14. Study of QAM Characteristics.
15. Design Pre-emphasis and De-emphasis for given specifications.

STRUCTURED
Simulation of All Experiments using MATLAB/OCTAVE/SCI-Lab/Python
OPEN ENDED
(Implementation of Analog and Digital communication transceivers)
Example:

1. Design FM transmitter for given specifications.(for e.g standard base station
of 90 Mhz)
2. Design AM transmitter for given specifications.

65

VLSI DESIGN

Year Semester Hours/Week Marks
C CIE SEE Total

L T P/D

III II 4 - 2 5 40 60 100

Pre-requisite Analog Circuit Analysis, Digital Electronics

COURSE OUTCOMES
At the end of the course the student will be able to:

1. Estimate the characteristics of CMOS circuits.
2. Optimization/ estimation of delay and power dissipation in the circuits.
3. Develop the logic circuit for best critical path/ delays.
4. Design and describe the data path circuits with proper clock distribution and

wiring.
UNIT- I MOSFET Basics
Basic MOS Transistor, Enhancement and Depletion type MOSFET and working, Ids – Vds
relationship of NMOS and PMOS transistors, MOS transistor threshold voltage,
transconductance (gm)and output conductance, pass transistor, NMOS inverter, Pull-up to
pull-down ratio (Zpu/Zpd) of nmos inverter (i)driven by another nmos inverter, and (ii)
driven through pass transistor, various pull ups mechanisms, CMOS inverter, Latch-up in
CMOS circuits
UNIT-II VLSI Fabrication
Introduction to IC Technology, Fabrication Process steps- Oxidation, Lithography,
Diffusion, Ion implantation, Metallization, NMOS/PMOS fabrication, n-well CMOS
Process, p-well CMOS Process, Twin Tub Processes, BiCMOS.
UNIT- III Stick diagram and Layouts
VLSI Design Flow, MOS layers, design rules, stick and layout diagrams for NMOS,
PMOS and CMOS Inverters, NAND, NOR gates.
UNIT- IV Basics of Scaling
Basic Circuit Concept: Sheet resistance, Area Capacitance, Capacitance standard unit,
Inverter delays, driving large Capacitive loads, Propagation delays, Wiring Capacitances.
MOS Scaling: Scaling models, scaling factors for device parameters, limitation of scaling,
short channel effects, Subthreshold current, drain induced barrier lowering, velocity
saturation, surface scattering.
UNIT- V Data Path Subsystems
Subsystem Design, shifters,Adders, ALUs, multipliers, parity generators, comparators,
zero/one detectors, counters.
TEXT BOOKS

1. CMOS VLSI Design: A Circuits and Systems Perspective-Book by David Harris
and Neil Weste

2. Digital Design and Computer Architecture-Book by David Harris
REFERENCE BOOK

1. Wayne Wolf, “Modern VLSI Design”, Pearson education, 3rd edition. 1997.
2. Digital VLSI Chip Design with Cadence and Synopsys CAD Tools-Book by Erik

Brunvand
3. Principles of CMOS VLSI Design, Neil H.E. Weste, K.Eshraghian, Pearson,

2009.

66

OBJECT ORIENTED PROGRAMMING CONCEPTS THROUGH JAVA

Year Semester Hours/Week Marks
C
L T P/D CIE SEE Total

III II 3 - - 3 30 70 100

Pre-requisite Nil

COURSE OUTCOMES
At the end of the course, the student will be able to

1. Identify classes, objects, members of a class and relationships among them needed for a
specific problem

2. Demonstrate the concepts of polymorphism inheritance and Reusability
3. Illustrate Java programs to implement error handling techniques using exception

handling
4. Compare Multithreaded programming with ordinary programming models
5. Build a GUI interface using Collections
UNIT I
Object-oriented thinking
A way of viewing world – Agents and Communities, messages and methods,
Responsibilities, Classes and Instances, Class Hierarchies- Inheritance, Method binding,
Overriding and Exceptions, Summary of Object-Oriented concepts. Java buzzwords, An
Overview of Java, Data types, Variables and Arrays, operators, expressions,
control statements, Introducing classes, Methods and Classes, String handling.
UNIT II
Inheritance
Inheritance concept, Inheritance basics, Member access, Constructors, Creating Multilevel
hierarchy, super uses, using final with inheritance, Polymorphism-ad hoc polymorphism, pure
polymorphism, method overriding, abstract classes, Object class, forms of inheritance-
specialization, specification, construction, extension, limitation, combination, benefits of
inheritance.
Packages
Defining a Package, CLASSPATH, Access protection, importing packages. Command Line
Arguments.
UNIT III
Interfaces
defining an interface, implementing interfaces, Nested interfaces, applying interfaces,
variables in interfaces and extending interfaces.
Exception handling
Fundamentals of exception handling, Exception types, Termination or resumptive models,
Uncaught exceptions, using try and catch, multiple catch clauses, nested try statements,
throw, throws and finally, built- in exceptions, creating own exception sub classes.

67

UNIT VI
Stream based I/O(java.io)
The Stream classes-Byte streams and Character streams, Reading console Input and Writing
Console Output, File class, Reading and writing Files, Random access file operations, The
Console class, Serialization, Enumerations, auto boxing, generics.
Multithreading
Differences between thread-based multitasking and process-based multitasking, Java thread
model, creating threads, thread priorities, synchronizing threads, inter thread communication.
UNIT V
The Collections Framework (java.util)
Collections overview, Collection Interfaces, The Collection classes- Array List, Linked List,
Hash Set, Tree Set, Priority Queue, Array Deque. Accessing a Collection via an Iterator,
Using an Iterator, The For-Each alternative, Map Interfaces and Classes, Comparators,
Collection algorithms, Arrays, The Legacy Classes and Interfaces- Dictionary, Hashtable ,
Properties, Stack, Vector More Utility classes, String Tokenizer, Bit Set, Date, Calendar,
Random, Formatter, Scanner
TEXT BOOKS

1. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill
Education (India) Pvt. Ltd.

2. Understanding Object-Oriented Programming with Java, updated edition, T.
Budd, Pearson Education.

REFERENCE BOOKS
1. An Introduction to programming and OO design using Java, J. Nino and F.A.
Hosch, John Wiley & sons.
2. Introduction to Java programming, Y. Daniel Liang, Pearson Education.
3. Object Oriented Programming through Java, P. Radha Krishna, Universities Press.
4. Programming in Java, S. Malhotra, S. Chudhary, 2nd edition, Oxford Univ. Press.
5. Java Programming and Object oriented Application Development, R.A. Johnson,
Cengage Learning.

68

OBJECT ORIENTED PROGRAMMING CONCEPTS THROUGH JAVA LAB

Year Semester Hours/Week Marks
C
L T P/D CIE SEE Total

II II - - 2 1 30 70 100

Pre-requisite Nil

COURSE OUTCOMES

At the end of the course, the students will develop ability to
1. Design, compile, test and execute straightforward programs using a high level
language.

2. Analyze implementation, compilation, testing and run java programs comprising more
than one class, to address a particular software problem.

3. Illustrate synchronization using multithreading.

4. Classify effective user interface applications through AWT controls and swings.

5. Program and examine use of members of classes in the Java API.

Week 1

1. Write a Java program that prints all real solutions to the quadratic equation ax2 + bx + c =
0. Read in a, b, c and use the quadratic formula. If the descriminent (b2 -4ac) is negative,
display a message stating that there are no real solutions.

2. The Fibonacci sequence is defined by the following rule:

The first two values in the sequence are 1 and 1. Every subsequent value is the sum of the
two values preceding it. Write a Java program that uses both recursive and non recursive
functions to print the nth value in the Fibonacci sequence.

Week 2

1. Write a Java program that prompts the user for an integer and then prints out all prime
numbers up to that integer.

2. Write a Java program to multiply two given matrices.

3. Write a Java Program that reads a line of integers, and then displays each integer, and the
sum of all the integers (Use StringTokenizer class of java.util)

69

Week 3
1. Write a Java program that checks whether a given string is a palindrome or not. Ex:

MADAM is a palindrome.
2. Write a Java program for sorting a given list of names in ascending order.
3. Write a Java program to make frequency count of words in a given text
Week 4
1. Write a Java program that reads a file name from the user, and then displays information

about whether the file exists, whether the file is readable, whether the file is writable, the
type of file and the length of the file in bytes.
2. Write a Java program that reads a file and displays the file on the screen, with a line
number before each line.
3. Write a Java program that displays the number of characters, lines and words in a text
file.
Week 5
1. Write a Java program that:
i.Implements stack ADT.
ii.Converts infix expression into Postfix form
iii.Evaluates the postfix expression
Week 6
1. Develop an applet that displays a simple message.
2. Develop an applet that receives an integer in one text field, and computes its factorial
Value and returns it in another text field, when the button named “Compute” is clicked.
Week 7
Write a Java program that works as a simple calculator. Use a grid layout to arrange Buttons
for the digits and for the +, -,*, % operations. Add a text field to display the result.
Week 8
1. Write a Java program for handling mouse events.
Week 9
1. Write a Java program that creates three threads. First thread displays “Good Morning”

Every one second, the second thread displays “Hello” every two seconds and the third
thread displays “Welcome” every three seconds.
2. Write a Java program that correctly implements producer consumer problem using the
concept of inter thread communication.

70

Week 10
Write a program that creates a user interface to perform integer divisions. The user enters two
numbers in the text fields, Num1 and Num2. The division of Num1 and Num2 is displayed in
the Result field when the Divide button is clicked. If Num1 or Num2 were not an integer, the
program would throw a Number Format Exception. If Num2 were Zero, the program would
throw an Arithmetic Exception Display the exception in a message dialog box.
Week 11
1. Write a java program that simulates a traffic light. The program lets the user select one

of three lights: red, yellow, or green. When a radio button is selected, the light is turned
on, and only one light can be on at a time No light is on when the program starts.
2. Write a Java program that allows the user to draw lines, rectangles and ovals.
Week12
1. A demonstration of the ProgressMonitor toolbar. A timer is used to induce progress.
2. This example also shows how to use the UIManager properties associated with progress
monitors.
3. Sample Swing application that manages several internal frames. This is the main class
for working with the SiteFrame and PageFrame classes.

71

SPECIALIZATION ELECTIVES

72

Specialization Elective

S. No. Course Code Course Hours/Week
L T P/D/J C
Specialization Elective I II III
3 -2 4
1. FPGA Based System Design
Electronic Measurement and 3 -2 4
3 -2 4
2. Instrumentation 3 -2 4
3 -2 4
3. Low Power VLSI 3 -2 4
3 -2 4
4. Programming for IoT 3 -2 4
3 -2 4
5. Fuzzy Logic for Machine Learning 3 -2 4

6. Digital Design through HDL 3 -2 4
3 -2 4
7. Network Security and Cryptography 3 -2 4
3 -2 4
8. Information Theory and Coding 3 -2 4
3 -2 4
9. Digital Image Processing 3 -2 4
3 -2 4
10. Machine Learning For Robotics 3 -2 4
3 -2 4
Speech and Language Processing 3 -2 4
11. using Deep Learning 3 -2 4
3 -2 4
12. Industrial Automation
3 -2 4
13. Graphics and Mobile Gaming 3 -2 4
3 -2 4
14. Embedded Linux
15. Analog IC Design

16. Nanoscience and Nanotechnology
17. ASIC and FPGA Design

18. Fundamentals of Photovoltaics

19. Digital IC Design

20. Synthesis of nanomaterials

21. System On Chip (SoC) Design

22. Optical and Quantum Electronics

23. VLSI Testing

Micro and Nano Electromechanical
24. Systems

25. VLSI Signal Processing Architecture

26. VLSI Interconnects

73

FPGA BASED SYSTEM DESIGN

Year Hours/Week P/D C Marks Total
Semester CIE SEE 100

LT

3- 24 40 60

Pre-requisite VLSI Design and Technology, Microcontrollers for Embedded
Systems

UNIT I: Introduction Digital system design options and tradeoffs, High Level System
Architecture and Specification: Behavioral modelling and simulation, Hardware description
languages, combinational and sequential design, state machine design, synthesis issues, test
benches.

UNIT-II: PROGRAMMABLE LOGIC CELLS AND I/O CELLS Anti fuse – static RAM –
EPROM and EEPROM technology – PREP bench marks – Actel ACT – Xilinx LCA – Altera
FLEX – Altera MAX DC & AC inputs and outputs – Clock and power inputs – Xilinx I/O
blocks.

UNIT-III: LOGIC SYNTHESIS, SIMULATION AND TESTING Verilog and logic
synthesis – VHDL and logic synthesis - Types of simulation – Boundary scan test – Fault
simulation – Automatic test pattern generation Built-in self test.

UNIT-IV: FLOOR PLANNING, PLACEMENT AND ROUTING System partition – FPGA
partitioning – partitioning methods – floor planning – placement – physical design flow –
global routing – detailed routing – special routing – circuit extraction – DRC.

UNIT V: Applications Simulation/implementation exercises of combinational, sequential on
Xilinx/Altera boards.

REFERENCES:
1. M.J.S. Smith, “Application Specific Integrated Circuits”, Pearson, 2000.
2. Peter Ashenden, “Digital Design using VHDL”, Elsevier, 2007.
3. Peter Ashenden, “Digital Design using Verilog”, Elsevier, 2007.
2. W.Wolf, “FPGA based system design”, Pearson, 2004.
3. Clive Maxfield, “The Design Warriors’s Guide to FPGAs”, Elsevier, 2004.

74

ELECTRONIC MEASUREMENT AND INSTRUMENTATION

Year Semester Hours/Week C Marks
CIE SEE Total
L T P/D

3 - 2 4 40 60 100

Pre-requisite Analog Electronics, Linear and Digital Circuits

COURSE OUTCOMES
At the end of the course, the students will develop ability to

1. Demonstrate various Electronic Instruments and their utilization.
2. Design and analyze the performance characteristics of instruments to select for
applications.
3. Illustrate the measurement of resistance, capacitance, inductance and
frequency using Bridge
4. Explain about different types of Oscilloscopes and signal analyzers.
5. Analyze various types of Active and passive transducers and select for
applications

UNIT I
Characteristics of Measuring Instruments
Significance of Measurement and block diagram of Measurement System. Errors in
measurement system– Gross error, systematic errors, Random errors.
Measuring Instruments
PMMC, DC voltmeter and current meters and its Extension ranges, True RMS Responding
Voltmeter, Average responding rectifier type voltmeter, electronic voltmeter, block diagram
approach for measurement of voltage, current and Resistance using Digital Multi Meter
(DMM), Q-meter – Series Method .

UNIT II
Bridges: DC Bridge- Wheatstone bridge, Kelvin's Double Bridge, AC Bridge- Maxwell’s
Bridge, Schering bridge and Wien’s Bridge.
Signal Analyzers
Frequency Selective and Heterodyne Wave Analyzers, Harmonic distortion Analyzers, Total
Harmonic distortion, Spectrum Analyzers.

UNIT III
Oscilloscopes
Cathode Ray Tube (CRT), Electrostatic Deflection, Post Deflection and Acceleration of
Electron Beam, Screens for CRT’s, Block diagram of CRO- Time-Base Generator, Delay
line, Attenuators, probes, Dual beam oscilloscope, Dual trace oscilloscope, Digital
Storage Oscilloscope , Applications of CRO: Measurement of Phase and Frequency using
Lissajous Patterns.
UNIT IV
Transducers
Transducer and its classification, ideal Requirements of Transducer – Resistive Transducer:
Potentiometric type, Strain Gauge type (Gauge factor derivation, SG materials, Bonded and
unbounded strain gauges) , Capacitive Transducers - Variable gap type, variable area type
and variable Dielectric type , Inductive Transducers - LVDT ,

75

UNIT V
Transducers Applications and smart Transducers
Applications of Thermocouple, Thermistor, Piezo Electric Transducers, RTD, photo voltaic
cell, LDR. IC Sensor for temperature- AD590, LM35, LM335.
Intelligent and smart transducers
Principle-design approach, interface design, configuration support, communication in smart
transducer networks .
TEXT BOOKS

1. Helfrick AD and Cooper WD, “Modern Electronic Instrumentation and
Measurement Techniques”, PHI.
2. AK Sawhney, “A Course in Electrical and Electronics Measurements and
Instrumentation”, Dhanpat Rai Publications, New Delhi, 2002.
REFERENCE BOOKS
1. Oilver and Cage, “Electronic Measurements and Instrumentation”, McGraw
Hill International Edition.
2. Golding EW and Wides FC, “Electrical Measurements and Measuring
Instruments”, Wheeler Publications.
3. BC Nakra and KK Chowdary, “Instrumentation Measurement and Analysis”,
TMH, New Delhi.

76

LOW POWER VLSI

Year Semester Hours/Week P/D C Marks Total
LT CIE SEE

3 - 24 40 60 100

Pre-requisite VLSI Design

COURSE OUTCOMES:
At the end of the course, the students will develop ability to

1. Understand the basics of low power circuit design.
2. Apply pipelining and parallel processing techniques to reduce the power of
circuits.
3. Design low power and high speed adder circuits.
4. Analyze different multiplier architectures.
5. Differentiate the performance of low power memory architectures.

UNIT –I
Fundamentals: Need for Low Power Circuit Design, Sources of Power Dissipation –

Switching Power Dissipation, Short Circuit Power Dissipation, Leakage Power Dissipation,
Glitching Power Dissipation, Short Channel Effects –Drain Induced Barrier Lowering and

Punch Through, Surface Scattering, Velocity Saturation, Impact Ionization, Hot Electron

Effect. Principles of Low power design. Low power VLSI Design limits.
UNIT –II
Low-Power Design Approaches: Low-Power Design through Voltage Scaling – VTCMOS
circuits, MTCMOS circuits, Architectural Level Approach –Pipelining and Parallel

Processing Approaches.

Switched Capacitance Minimization Approaches: System Level Measures, Circuit Level

Measures, Mask level Measures.
UNIT –III
Low-Voltage Low-Power Adders: Introduction, CMOS Adder’s Architectures – Ripple

Carry Adders, Carry Look-Ahead Adders, Carry Select Adders, Carry Save Adders, Low

power circuit design styles: Non clocked logic and clocked logic families. Power Reduction

in Clock Networks.
UNIT –IV

Low-Voltage Low-Power Multipliers: Introduction, Overview of Multiplication, Types

of Multiplier Architectures, Array multiplier, Braun Multiplier, Baugh- Wooley Multiplier,

Booth Multiplier, Introduction to Wallace Tree Multiplier.

UNIT –V
Low-Voltage Low-Power Memories: Basics of ROM, Low-Power ROM Technology,
Future Trend and Development of ROMs, Basics of SRAM, Memory Cell, Precharge and
Equalization Circuit, Low-Power SRAM Technologies, Low Power Techniques for
SRAM, Basics of DRAM, Self-Refresh Circuit, Future Trend and Development of DRAM.

TEXT BOOKS:
1. Kaushik Roy and Sharat C. Prasad, “Low Power CMOS VLSI Circuit Design”, John

Wiley and Sons, 2000.
2. Kiat - Seng Yeo and Kaushik Roy, “Low Voltage, Low Power VLSI Subsystems”,

McGraw-Hill Education, 2004.

77

REFERENCE BOOKS:
1. Gary Yeap, “Practical Low Power Digital Vlsi Design”, Springer, 1998.
2. John P Uyemura, “Introduction to VLSI Circuits and Systems”, John Wiley, New
Delhi, 2006.
3. Dimitrios Soudris, Christian Piguet, Costas Goutis, Designing CMOS Circuits for
Low Power, Springer 2010.

78

PROGRAMMING FOR IOT

Year Semester Hours/Week C Marks SEE Total
L T P/D CIE 50 100

3 - 2 4 50

Pre-requisite Introduction to IoT

COURSE OUTCOMES
At the end of the course, the students will develop ability to

1. Describe the Linux basic features.
2. Explain the features of raspberry Pi
3. Discuss about raspberry Pi programming using Python
4. Interface external devices with raspberry Pi
5. Illustrate image processing application with raspberry Pi
Unit-I
Linux Basics: How Linux built, Linux Commands, Users and Groups, Linux History, Text
Editors, Files and Filesystems, Linux Kernel Architecture v Shells, bash, and the Command,
Filesystem Layout, Linux Licence Line, Linux Filesystems, Linux Kernel Features, Essential
Command Line Tools, Building RPM and debian Packages.
Unit-II
Single Board Computers #1:
Raspberry Pi Introduction to Raspberry Pi, About the Raspberry Pi Board: Hardware Layout
and Pinouts, Operating Systems on Raspberry Pi, Configuring Raspberry Pi, Programming
Raspberry Pi, Connecting Raspberry Pi via SSH, Remote access tools.

Unit-III
Python Programming:
Overview of Python-Applications over IoT & Advantages of Python, Introduction to Python
Concepts-Scope, Data Types, Files, Functions, Modules and Packages, Standard Libraries,
Python OOPS Concepts, Multi-threading in Python.

Unit-IV
Single Board Computer #2
Interfacing basic IO Devices, Sensors and Actuator, Reading Data from sensors and storing
locally on file system and database, Sending Sensors data to Remote Server, Controlling
Electric Loads through internet.

Unit-V
Single Board Computer #3
Rename if required Interfacing Camera and Audio input devices to Raspberry Pi, Working
with OpenCV - Installation, Accessing Pi Camera using opencv, Analysing the video
with opencv.
Text Books:

1. Martin C Brown, “Python: The Complete Reference”, McGraw Hill, 2nd
Edition, 2018.
2. Matt Richardson and Shawn Wallace, “Getting Started with Raspberry
Pi”, O'Reilly(SPD)/ Prentice Hall.
Reference: Zed A. Shaw, “Learn Python the Hard Way” O’Reilly, 1st Edition, 2013.

79

FUZZY LOGIC FOR MACHINE LEARNING

Year Semester Hours/Week C Marks SEE Total
L T P/D CIE 60 100

3- 24 40

Pre-requisite Artificial Intelligence, Mathematics

UNIT-I
INTRODUCTION TO NEURAL NETWORKS: Differences between Biological and
Artificial Neural Networks - Typical Architecture, Common Activation Functions,
McCulloch - Pitts Neuron, Case study: Modeling the Perception of Hot and Cold, Simple
Neural Nets for Pattern Classification, Linear Separability - Hebb Net, Perceptron -
Architecture, algorithm - Case study: Character Recognition.

UNIT-II
PATTERN ASSOCIATION: Training Algorithms for Pattern Association - Hebb rule and
Delta rule, Hetero-associative, Auto-associative and Iterative Auto associative Net,
Bidirectional Associative Memory - Architecture, Algorithm, and Simple Applications - Case
study: Character Recognition.

UNIT-III
COMPETITION AND BACKPROPAGATION NEURAL NETWORKS: Kohonen Self
Organising Maps - Architecture, Algorithm and Applications - Standard Back propagation
Architecture, Architecture of Boltzmann Machine Learning.

UNIT-IV
SETS AND RELATIONS: Properties and Operations on Classical and Fuzzy Sets, Crisp
and Fuzzy Relations - Cardinality, Properties and Operations, Composition, Tolerance and
Equivalence Relations, Simple Problems.

UNIT-V
MEMBERSHIP FUNCTIONS: Features of membership function, various forms,
fuzzification, Defuzzification to crisp sets, Lambda Cuts for fuzzy relations Defuzzification
to scalars.
APPLICATIONS: Neural Networks: Robotics, Image compression, Control systems -
Fuzzy Logic: Mobile robot navigation, Autotuning a PID Controller.

TEXT BOOKS:
1. Laurene Fausett, ―Fundamentals of Neural Networks: Architectures, Algorithms and

Applications‖, Pearson Education, New Delhi, 2004.
2. Timothy Ross, ―Fuzzy Logic with Engineering Applications‖, Mc Graw Hill, Singapore,

2002.

80

REFERENCES:
1. Sivanandam S N, Sumathi S, Deepa S N,‖ Introduction to Neural Networks using Matlab

6.0,‖ Tata McGrawHill, New Delhi, 2006.
2. Mohammad H Hassoun, "Fundamentals of Neural Networks",Prentice hall of India, New

Delhi, 2002. 3. John Yen and Rezalangari, "Fuzzy Logic, Intelligence, Control and
Information ", Pearson Education, New Delhi, 2007.

81

DIGITAL DESIGN THROUGH HDL

Year Semester Hours/Week Marks SEE Total
C CIE 60 100

L T P/D

3- 24 40

Pre-requisite Digital Electronics

COURSE OUTCOMES
At the end of the course, students will develop the ability to
1. Analyze circuits in terms of hardware description language.
2. Develop program codes for gate level modeling of logic circuits.
3. Design digital circuits using behavioral & dataflow models
4. Write function codes of any digital system and perform component testing and

verification using Verilog HDL.

UNIT I
Introduction to Verilog HDL
Verilog as HDL, Level of Design description, Concurrency, Simulation and Synthesis,
Function Verification, System tasks, Programming Language interface, Module, Simulation
and Synthesis tools.
Language Constructs and Conventions
Keywords, Identifiers, White space Characters, Comments, Numbers, Strings, Logic Values,
Strengths, Data types, Scalars and vectors, parameters, operators.

UNIT II
Gate Level Modeling
Introduction, AND Gate Primitive, Module structure, other gate primitives, illustrative
examples, tristate gates, array of instances of primitives, Design of Flip-Flops with gate
primitives, Delays, Strengths and Construction resolution, Net types, Design of basic circuit.
Simulation of example Modules with XILINX Tool
UNIT III
Behavioral Modeling
Introduction, Operations and assignments, functional bifurcation, ‘Initial’ construct, ‘always’
construct, Assignments with Delays, ‘wait’ construct, multiple always block, Design at
behavioral level, blocking and non-blocking assignments, the ‘case’ statement, simulation
flow ‘if’ an ‘if-else’ constructs, ‘assign-de-assign’ construct ‘repeat’ construct, for loop, ‘the
disable’ construct, ‘while loop’, forever loop, parallel blocks, ‘force- release’, construct,
Event. Simulation of example Modules with XILINX Tool

UNIT IV
Modeling at Dataflow Level
Introduction, Continuous assignment structure delays and continuous assignments,
assignment to vectors, operators. Switch level modeling: Basic transistor switches, CMOS
switches, bi directional gates, time delays with switch primitives, instantiation with
‘strengths’ and ‘delays’ strength contention with Trireg nets. Simulation of example Modules

82

with XILINX Tool
UNIT V
Component Test and Verification
Test bench – combinational circuit testing, sequential circuit testing, test bench techniques,
design verification, assertion verification.
TEXT BOOKS
1. Samir Palnitkar, “Verilog HDL: A Guide to Digital Design and Synthesis”, Pearson

Education, 2005.
2. Ming-Bo Lin., “Digital System Designs and Practices Using Verilog HDL and FPGAs”,

Wiley, 2008.
REFERENCE BOOKS
1. Michael D. Ciletti, “Advanced Digital Design with the Verilog HDL”, PHI, 2005.
2. J. Bhasker, “Verilog HDL Synthesis - A Practical Primer”, 3rd Edition, 2005.
3. Stephen D. Brown and Zvonko G. Vranesic, “Fundamentals of Digital Logic with Verilog

Design”, McGraw Hill, New Delhi, 2nd Edition, 2008.

83

NETWORK SECURITY AND CRYPTOGRAPHY

Year Semester Hours/Week Marks SEE Total
C CIE 60 100
40
L T P/D

3- 24

Pre-requisite Introductiont to Programming

PURPOSE This course provides a way to understand Network Security and different types
of Cryptographic techniques. It enables the student to have a mix of fundamental concepts
together with practical aspects of security.

COURSE OBJECTIVES
1. To study the Importance of Firewalls and their types.
2. To study cryptographic algorithms.
3. To study cryptographic protocols.
4. To study Wireless security
5. To study RFID’s and E- Passports

UNIT I
INFORMATION SECURITY BASICS AND TYPES OF ATTACKS: Information
Security- History- Security as a process, Not Point Products- Access Attacks- Modification
Attacks- Denial - of- Service Attacks- Repudiation Attacks- IP Spoofing- Malicious Code

UNIT II
INFORMATION SECURITY SERVICES AND ENCRYPTION: Information Security
Services- Confidentiality- Integrity- Availability- Accountability Secret key Encryption-
DES-AES (Rijndael)- Number Theory – Prime number – Modular arithmetic – Euclid’s
algorithm - Fermet’s and Euler’s theorem – Discrete logarithm - Public Key Encryption-
Diffie- Hellman Key Exchange- Elliptic Curve Cryptography

UNIT III
FIREWALLS AND INTRUSION DETECTION: Firewalls– Types of Firewalls –Intrusion
Detection- Types- Setup and Manage Intrusion Prevention

UNIT IV
WIRELESS LAN SECURITY AND CELLPHONE SECURITY: Authentication
Confidentiality and Integrity- GSM Security- Security UMTS

UNIT V
RFIDS AND E-PASSPORTS: RFID Basics- applications- Security Issues- Generation 2
tags- Addressing RFID Privacy Concerns- Electronic Passports

REFERENCES
1. Eric Maiwald , “Fundamentals of Network Security”, Tata McGraw Hill Edition, 2011.

84

2. Bernard Menezes,“Network Security and Cryptography”, Cengage Learning, India
Edition,2010.

3. Behrouz A.Forouzan, Debdeep Mukhopadhyay, “Cryptography and Network Security”,
Tata McGraw Hill Second Edition, 2010.

4. Pallapa Venkataram, “Wireless and Mobile Network Security”, Tata McGraw Hill
Edition, 2010.

5. Terry Parode, Gordon Snyder, “Network Security” Cengage Learning, India
Edition,2008.

6. William Stallings, “Cryptography & Network Security”, Pearson Education, 4th Edition
2010.

85

INFORMATION THEORY & CODING

Year Semester Hours/Week C Marks
CIE SEE Total
L T P/D

3 - 2 4 40 60 100

Pre-requisite Signals and Systems, Probability Theory and Stochastic Process

COURSE OUTCOMES

At the end of the course, the students will develop ability to
1. Illustrate the average information content of symbol
2. Apply different encoding algorithms for source coding.
3. Compute channel capacity of discrete memory less channels.
4. Analyse error detecting and error correcting codes like linear block codes, cyclic
codes and convolution codes.

UNIT I

Introduction to Information Theory

Introduction, Measure of information. Average information content of symbols in long

independent sequences, Properties of Entropy, Information rate, Mutual information and its

properties.

UNIT II

Source Coding
Introduction, Source coding theorem (Shannon’s first theorem), Shannon Fano Algorithm,

Huffman Coding.

UNIT III

Communication Channels

Introduction, Discrete Communication channels, Channel Capacity of Discrete memory less

channels, discrete channels with memory, Continuous channels.

UNIT IV

Error Detecting and Correcting Codes

Linear Block Codes: Introduction, Matrix description of Linear Block codes, Error

Detecting and Correcting Capability of Linear block codes.

Binary Cyclic Codes

Binary Cyclic Codes, Algebraic structures, Encoding syndrome calculation, BCH codes.

UNIT V

Convolution Codes: Introduction, encoding of convolution codes, state, tree and trellis

diagram, decoding using Viterbi algorithm.

TEXT BOOKS
1. K. Sam Shanmugam, “Digital and Analog Communication Systems”, John Wiley,

1996.
2. John G Proakis, “Digital Communication”, 5th Edition, TMH, 2008.

REFERENCE BOOKS
1. Simon Haykin, “Digital Communication”, John Wiley, 2003.
2. Dr. Bernard Sklar, “Digital Communications Fundamentals and Applications”,
2nd Edition, Pearson Education, 2001.

86

DIGITAL IMAGE PROCESSING

Year Semester Hours/Week Marks SEE Total
C CIE 60 100
40
L T P/D

3- 2 4

Pre-requisite Signals and Systems

COURSE UTCOMES:
At the end of the course, the students will develop ability to
1. Acquire the fundamental concepts of a digital image processing system.
2. Perform different filtering for image enhancement.
3. Analyze various features for image segmentation.
4. Know object recognition for classification.
5. Examine real time video processing for embedded control.

UNIT I

FUNDAMENTALS OF IMAGE PROCESSING
Introduction – Steps in image processing systems – Image acquisition -Sampling and
Quantization – Pixel relationships – Color fundamentals and models, Image operations –

Arithmetic and logical operations, point operations.

UNIT II
IMAGE ENHANCEMENT
Spatial Domain: Gray level Transformations – Histogram processing – Spatial filtering,
smoothing and sharpening.
Frequency Domain: Filtering in frequency domain – DFT, FFT, DCT – Smoothing and
sharpening filters – Homomorphic Filtering.

UNIT III
IMAGE SEGMENTATION AND FEATURE ANALYSIS
Detection of Discontinuities – Edge operators - Edge linking and Boundary Detection -
Thresholding – Region based segmentation – Morphological Watersheds – Motion
Segmentation.

UNIT IV
OBJECT RECOGNITION
Introduction – Pattern and Pattern Class – Selection Measurement Parameters – Approaches –
Types of Classification – Bayes, Template matching, Non parametric density estimation,
Neural Network approach – Applications.

UNIT V
VIDEO PROCESSING
Real time image and Video processing – parallelism – Algorithm simplification strategy –
Hardware platforms – DSP, FPGA, GPU, General purpose processors.

87

TEXT BOOKS:
1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, 3rd Edition,

Pearson Eduction, 2009.
2. Nasser Kehtarnavaz, Mark Noel Gamadia, “Real-time image and video processing: from

research to reality”, Morgan Claypool publishers, 2006.
REFERENCE BOOKS:
1. Milan Sonka, Vaclav Hlavac and Roger Boyle, "Image Processing, Analysis and Machine

Vision", 2nd Edition, Thomson, 2007.
2. Anil K. Jain, "Fundamentals of Digital Image Processing", Pearson Education, 2003.

88

MACHINE LEARNING FOR ROBOTICS

Year Semester Hours/Week C Marks Total
L T P/D CIE SEE

3 - 2 4 40 60 100

Pre-requisite Machine Learning

COURSE OUTCOMES

Students will be able to

1. Understand the basic concepts of machine learning and its techniques.

2. Analyze the strategies of supervised and unsupervised learning.

3. Realize the importance of Neural networks in machine learning.

4. Evaluate the performance of different learning techniques.

5. Develop a foundation to learn advancements in machine learning.

UNIT-I
INTRODUCTION: Machine learning – Varieties of Machine learning – Learning Input-
Output functions: Types of learning – Input Vectors – Outputs – Training regimes – Noise –

Performance Evaluation.

UNIT-II
FOUNDATIONS OF SUPERVISED LEARNING: Decision trees and inductive bias –
Geometry and nearest neighbors – Logistic regression – Perceptron – Binary classification.

UNIT-III
ADVANCED SUPERVISED LEARNING: Linear models and gradient descent – Support
Vector machines – Naïve Bayes models and probabilistic modeling – Model selection and
feature selection – Model Complexity and Regularization.

UNIT-IV

UNSUPERVISED LEARNING: Curse of dimensionality, Dimensionality Reduction, PCA,
Clustering – K-means – Expectation Maximization Algorithm – Mixtures of latent variable
models – Supervised learning after clustering – Hierarchical clustering

UNIT-V

NEURAL NETWORKS: Network Representation, Feed-forward Networks, Back

propagation, Gradient-descent method.

TEXT BOOKS:
1. Tom Mitchell, Machine Learning‘, McGraw Hill, 1997.

2. Peter Flach, Machine Learning: The Art and Science of Algorithms that make sense of
data‘, Cambridge, 2014.

REFERENCES:
1. Hal Daume III, ‘A course in Machine Learning’, Todo, 2015.
2. EthemAlpaydin, ‘Introduction to Machine Learning’, The MIT Press, 2004
3. David MacKay, ‘Information Theory, Inference and Learning Algorithms’, Cambridge,

2003

89

SPEECH AND LANGUAGE PROCESSING USING DEEP LEARNING

Year Hours/Week C Marks
Semester CIE SEE Total

L T P/D

3 - 2 4 40 60 100

Deep Learning for Computer Vision

COURSE OUTCOMES:
1. Understanding the acoustics of speech production and perception
2. Analyzing efficient speech features used for modelling
3. Understanding various algorithms on Deep learning based Speech modelling

UNIT I
Overview of Speech Processing Systems, Speech Production, Speech Perception, Speech
Signal Characteristics, Sounds (Syllables, Phonemes, etc.), and Properties of speech sounds.
Introduction to speech technology:
Fundamentals of speech perception and speech production. Speech spectrum: STFT,
Spectrogram. Features: Cepstrum, MFCC, Pitch. Techniques: Vector Quantizers, Gaussian
Mixture Models.

UNIT II
Deep Learning:
Introduction to deep learning, neural nets, learning algorithms, momentum and RMSProp,
regularization, word embeddings, recursive neural networks. Applications to Natural
Language Processing.

UNIT III
Automatic speech recognition:
Pattern matching. Dynamic time warping Hidden Markov models. Isolated word recognition
Large vocabulary continuous ASR: Acoustic modelling. Language modelling Deep Learning
for language modelling and automatic speech recognition. Toolkits

UNIT IV
Speech synthesis:
Linguistic processing. Prosody modelling, Waveform generation. Concatenation and
statistical methods. Deep learning in speech synthesis.

UNIT V
Machine Translation.
Introduction to Machine Translation, Statistical Machine Translation, Neural Machine
Translation, Speech translation.

TEXT BOOKS

90

1. Goodfellow, I.; Bengio, Y.; Courville, A. Deep Learning [on line]. Cambridge,
Massachusetts: MIT Press, 2016 [Consultation: 22/06/2016]. Available on:
http://www.deeplearningbook.org/. ISBN 9780262035613.

2. Huang, X.; Acero, A.; Hon, H-W. Spoken language processing: a guide to theory,
algorithm and system development. Upper Saddle River: Prentice Hall, 2001. ISBN
0130226165.

91

GRAPHICS AND MOBILE GAMING

Year Semester Hours/Week Marks SEE Total
C CIE 60 100

L T P/D

3- 24 40

Pre-requisite Introduction to Programming

COURSE OUTCOMES
At the end of the course, the students will develop ability to
1. Mali GPU architecture
2. Core OpenGL ES rendering techniques
3. Game design methodology
4. Ability to create computer graphics on mobile devices using OpenGL ES
5. Ability to create 3D games from scratch using commercial game design engines

UNIT I
Introduction to Graphics and Mobile Gaming: Graphic processor, GPU pipeline,
representation of a 3D scene on a flat surface, Installing the tools, initializing OpenGL,
creating a renderer class, Introducing the OpenGL pipeline-vertex shader, fragment shader,
GPU – generations, Architecture and features. Comparison of GPU with CPU, Mali GPU,
tessellation in computer graphics, geometry processing, rendering methods.

UNIT II
Introduction to Graphics API and OpenGL ES: OpenGL vs Open GL ES, OpenGL ES
versions, OpenGL vs Direct3D,Rendering Pipeline and Shader Programming-fixed vs
programmable rendering, pipeline shaders, programming of shaders in OpenGL ES,
clipspace, rasterization, test and blending, varying variable, uniforms, textures, attributes vs
uniforms.

UNIT III
3D Graphics and Matrix Manipulation: Matrices, translation using matrix, scaling, adding
rotation, Adding detail with textures-understanding textures, loading textures into OpenGL,
creating a new set of shaders, creating a new class structure for our vertex data, adding
classes for our shader programs, drawing our texture, UV mapping, lighting up the world –
simulating of light, implementing a directional light with Lambertian reflectance, adding
point lights, Performance Optimization Techniques for graph processing.

UNIT IV
Introduction to Mobile Gaming: History of video games, video game engines, coding
languages for game development, Game Graphics- Color cells, NTSC, artifact coloring and
television interface adapters driven graphics-for generating color, composing video games in
2D and 3D, computer graphic mapping techniques for video games.

UNIT V

92

Video Game Design: Role playing games, sports games, racing games, fighting games, FPS
games, five phases of software development process, iterative prototyping method, key
components of game and game loop, features of unity 3D scenes, 3D Effects-animation
techniques, particle effects, shader effect, camera model, simulation (rigid and soft body),
Virtual Reality (VR)-concepts, VR vs augmented reality, phone based products, stereoscopic
rendering, eye tracking, multiview rendering, multisampling and clock locking.
TEXT BOOKS
1. OpenGL ES 2 for Android: A Quick-Start Guide (Pragmatic Programmers) by Kevin

Brothaler.
2. Game Design Theory by Keith Burgun.
REFERENCE BOOKS
1. Performance Optimization Techniques and Tools for Distributed Graph Processing

VASILIKI KALAVRI

93

ANALOG IC DESIGN

Year Hours/Week P/D C Marks Total
Semester CIE SEE 100
40 60
LT

3 - 24

Pre-requisite Solid-state Device and Modeling

COURSE OUTCOMES:
At the end of the coursework, the student will develop the ability to

1. Explore MOS based Single Stage Amplifiers.
2. Design the Differential amplifiers and Current Mirrors.
3. Investigate the Frequency response of analog circuits.
4. Design operational amplifiers.

UNIT – I
Basic MOS Device Physics: Introduction to analog design, MOSFET as a Switch, MOSFET
Structure, MOS I/V characteristics, Threshold voltage, MOSFET as a Diode, MOSFET as a
Resistor, Transconductance, Bulk bias, Channel length modulation, Sub-threshold current,
MOS Device Capacitances, MOS small signal model.
UNIT II
Single Stage Amplifiers: Basic Concepts, Common Source (CS) Stage - CS Stage with
resistive load, diode connected load, current source load, CS stage with source degeneration,
Source follower, Common gate stage, Cascode stage.
UNIT – III
MOS Differential Amplifiers: Single-Ended and Differential Operation, Basic Difference
pair – Qualitative and Quantitative Analysis, Common mode response, CMRR, Differential
pair with MOS loads, Gilbert Cell.
UNIT-IV
Current Mirrors: Basic Current Mirror, Wilson Current Mirror, Cascode Current Mirror.
Frequency Response of Amplifiers: Miller Effect, Association of Poles with
Nodes, Frequency response of CS Stage, Source Follower, and Common Gate stage.
UNIT – V
CMOS Operational Amplifiers: Design of Single stage CMOS Op-Amps, Design of Two-
Stage Op-Amps, Input Range Limitation, Slew Rate, Power- Supply Rejection Ratio of Two-
Stage Op Amps. Multipole system, Phase Margin, Frequency Compensation Techniques
TEXTBOOKS:

1. Design of Analog CMOS Integrated Circuits- Behzad Razavi, TMH Edition.
2. CMOS Analog Circuit Design - Philip E. Allen and Douglas R. Holberg,
Oxford University Press, International Second Edition/Indian Edition, 2010.

REFERENCE BOOKS:
1. Analog Integrated Circuit Design- David A. Johns, Ken Martin, Wiley
Student Edn, 2013.
2. CMOS: Circuit Design, Layout and Simulation- Baker, Li and Boyce, PHI.
3. Analysis and Design of Analog Integrated Circuits- Paul R. Gray, Paul J.
Hurst, S. Lewis and R. G. Meyer, Wiley India, Fifth Edition, 2010

94

NANO SCIENCE AND NANO TECHNOLOGY

Year Semester Hours/Week P/D C Marks Total
LT CIE SEE 100

3 - 24 40 60

Pre-requisite

COURSE OUTCOMES:
At the end of course, the students should be able to:

1. Create a holistic view of nanoscience, nanotechnology and nanoworld.
2. Compile the nano materials and effect of nano sized particles on their properties.
3. Analyze the different types of nanostructures and their applications.
4. Design the nanobiomaterials in the future perspectives of nanobiology.
UNIT I
Fundamentals of Nanotechnology: Introduction–Scientific revolutions, Time and length
scale in structures, Definition of a nanosystem, Dimensionality and size
dependent phenomena, Surface to volume ratio, Fraction of surface atoms, Surface energy
and surface, stress, surface defects, Properties at nanoscale (optical, mechanical, electronic,
and magnetic).

UNIT II
Different Classes of Nanomaterials: Classification based on dimensionality, Quantum Dots,
Wells and Wires, Carbon, based nano materials (bucky balls, nanotubes, graphene), Metal
based nano materials (nano gold, nano silver and metal oxides), Biological nano materials.

UNIT III
Synthesis of Nanomaterials: Chemical Methods: Metal Nano crystals by Reduction,
Solvothermal Synthesis, Photochemical Synthesis, Chemical Vapor Deposition(CVD).
Physical Methods: Ball Milling, Electrodeposition, Spray Pyrolysis,, Flame Pyrolysis, DC/RF
Magnetron Sputtering, Molecular Beam Epitaxy (MBE).

UNIT IV
Fabrication and Characterization of Nanostructures: Nanofabrication: Photolithography
and its limitation, Electron beam lithography (EBL), Nano-Pen lithography, Nanoimprint
lithography.
Characterization: Field Emission Scanning Electron Microscopy (FESEM). High Resolution
Transmission Electron Microscope (HRTEM), Scanning Tunneling Microscope (STM),
Atomic Force Microscopy (AFM), Surface enhanced Raman spectroscopy (SERS), X-ray
Photoelectron Spectroscopy (XPS).

UNIT V
Applications: Solar energy conversion and catalysis, Molecular electronics
and flexible printed electronics, Nano electronics, Applications in displays, and other devices,
Nano materials for data storage, Photonics, Chemical and biosensors, Nano medicine and
Nano biotechnology, Nano toxicology challenges.

95

TEXT BOOKS:
1. Pradeep T, “A Textbook of Nanoscience and Nanotechnology”, Tata McGraw Hill
Education Pvt. Ltd, 2012.
2. Hari Singh Nalwa, “Nanostructured Materials and Nanotechnology”, Academic Press,
2002.

REFERENCES BOOKS:
1. Nabok A, “Organic and Inorganic Nanostructures”, Artech House, 2005.
2. Dupas C, Houdy P and Lahmani M, “Nanoscience : Nanotechnologies and
Nanophysics”, Springer-Verlag, Berlin Heidelberg.
3. Laxman Raju Thoutam, Chapter 1 in “Computational Technologies in Materials
Science”, CRC Press,2021

96

FUNDAMENTALS OF PHOTOVOLTAICS

Hours/Week Marks
Semester
Year C SEE Total
L T P/D CIE 100

3- 2 4 40 60

Pre-requisite Basic semiconductor physics, mathematics

COURSE OUTCOMES
At the end of the course, the student will develop ability to

1. Describe the fundamental physics of solar photovoltaics.
2. Analyse different ways of designing the PV devices.
3. Understand and compare the commercial PV devices.
4. Describe elaborately the emerging PV devices.
5. Demonstrate the connection and working of PV modules.

UNIT I
Introduction
Demand of renewable energy, energy related environmental problems, brief history of solar
photovoltaics; Fundamentals of semiconductors – drift, diffusion, Carrier generation,
recombination, continuity equation, P-N junction diode- under equilibrium, non-equilibrium,
and illumination, Solar cell characterization.
UNIT II
Design of solar cells
Upper limit of parameters – short circuit current, open circuit voltage, fill factor, efficiency;
Losses in solar cells – equivalent circuit, temperature effect, solar radiation effect, series and
shunt resistances effect; Solar cell design, analytical techniques – solar simulator.
UNIT III
Commercial solar cells
Development of commercial solar cells, process flow, different processes, High efficiency
solar cells; Thin film solar cell – advantages, materials, features, structures; Amorphous
silicon solar cell.
UNIT IV
Emerging solar cells
Organic solar cells, Dye-Sensitized solar cells, GAAS solar cells, Thermo photovoltaics,
Beyond single junction efficiency limit- multijunction, intermediate band gap, up/down
conversion, hot carrier solar cells.
UNIT V
Solar radiation and PV modules
Solar radiation –terrestrial and extra-terrestrial solar spectrum, Sun tracking; PV modules,
Mismatches in series and parallel connection, Design of PV modules, power of PV module.

TEXT BOOKS
1. Chetan Singh Solanki, “Solar Photovoltaics: Fundamentals, Technologies and
Applications”, PHI Learning Publications, ISBN: 978-8120351110, 2015.
2. Soteris Kalogirou, “Solar Energy Engineering: Processes and Systems”, Academic
Press, Elsevier, ISBN: 978-0-12-397270-5, 2014.

97

REFERENCE BOOKS/WEBSITES
1. Alexander P. Kirk, “Solar Photovoltaic cells: Photons to Electricity”, Academic Press
Elsevier, ISBN: 978-0-12-802603-8, 2015.
2. Stephen Fonash, “Solar cell device physics”, Academic Press Elsevier, ISBN: 978-0-
12-374774-7, 2010.
3. www.pveducation.org

98

DIGITAL IC DESIGN

Year Hours/Week P/D C Marks Total
Semester CIE SEE 100

LT

3 - 24 40 60

Pre-requisite Digital Electronics, Solid state Device and Modeling

COURSE OUTCOMES:
At the end of the coursework, the student will develop the ability to

1. Apply the concepts of wire modeling to find the delay caused by them.
2. Apply the concept of CMOS Inverter in analyzing the digital circuits.
3. Design the CMOS Combinational and Sequential Circuits.
4. Design the SRAM and DRAM.

UNIT – I
Basics: Basic MOS structure and its static behavior, Secondary Effects, Interconnect
Parameters, Electrical Wire Models: The ideal wire; The lumped model; The lumped RC
model, The distributed rc model.
UNIT – II
The CMOS Inverter: Introduction, Static CMOS Inverter, Static Behavior, Robustness to
Static behavior, Noise Margin, Dynamic Behavior: Computing the Capacitances, Propagation
Delay, Power and Energy, Technology Scaling and its Impact on the Inverter Metrics
UNIT – III
Combinational Logic Gates in CMOS: Introduction, Static CMOS Design-Complementary
CMOS; Ratioed Logic; Pass-transistor logic, Dynamic CMOS Design- Dynamic Logic;
Speed and Power Dissipation of Dynamic Logic, Cascading Dynamic Gates
UNIT-IV
Designing Sequential Logic Circuits: Static latches and registers, Bi-stability principle,
MUX based latches, Static SR flip-flops, Master-slave edge-triggered register, Dynamic
latches and registers, Concept of pipelining.
UNIT – V
Designing Memory: Memory Classification, Memory architecture, Read-only memories
(ROM), Read-write memories (RAM) – 4T - SRAM, 6T-SRAM; 1T-DRAM, Address
Decoder, Sense Amplifier.
TEXTBOOKS:

1. J. M. Rabaey, A. P. Chandrakasan and B. Nikolic, Digital Integrated Circuits : A
Design Perspective, Second Edition, PH/Pearson.

REFERENCE BOOKS:
1. S. M. Kang and Y. Leblebici, CMOS Digital Integrated Circuits : Analysis and
Design, Third Edition, MH.
2. N. Weste, K. Eshraghian and M. J. S. Smith, Principles of CMOS VLSI Design : A
Systems Perspective, Second Edition (Expanded), AW/Pearson.
3. J. P. Uyemura, Introduction to VLSI Circuits and System, Wiley.
4. R. J. Baker, H. W. Li and D. E. Boyce, CMOS Circuit Design, Layout and
Simulation, PH.

99

SYSTEM ON CHIP (SoC) DESIGN

Year Semester Hours/Week P/D C Marks Total
LT CIE SEE

III II 3 - 24 40 60 100

Pre-requisite IC Fabrication Technology

COURSE OUTCOMES:

At the end of the course, the students will develop ability to

1. Understand the fundamentals of system architecture and memory.

2. Analyze the various processor architectures.

3. Design internal and external SoC memories.

4. Assess different interconnect architectures and Reconfigurable technologies.

5. Apply SOC design approach in applications such as video compression and

image compression.
UNIT –I

Introduction to System Architecture: Overview of system architecture- Components of the

System: Processors, Memories, and Interconnects, Processor architectures, Memory and

addressing, System level interconnection, An Approach for SOC Design, Reliability,

Configurability.
UNIT –II

Processors: Basic Concepts in Processor Architecture, Processor Selection for SOC,

Processor Microarchitecture, Basic Elements in Instruction Handling, Buffers: Minimizing

Pipeline Delays, Branches: Reducing the Cost of Branches, More Robust Processors: Vector,

Very Long, VLIW Processors, Superscalar Processors.

UNIT -III
Memory Design: System-on-Chip: Introduction, SOC – Internal and external

memory, Scratchpads and Cache Memory, Cache Organization, Strategies for Line

Replacement at Miss Time, Split I- and D-Caches and the Effect of Code Density, Multilevel

Caches, SOC (On-Die) Memory Systems, Board-based (Off-Die) Memory Systems, Models
of Simple Processor–Memory Interaction.
UNIT –IV

Interconnects and SOC Customization and Configuration: Overview of Interconnect

Architectures, SOC Standard Buses, Beyond the Bus: NOC with Switch Interconnects,

Layered Architecture and Network Interface Unit, SOC Customization- Customizing

Instruction Processors, Reconfigurable Technologies, Mapping Designs Onto Reconfigurable

Devices, Reconfiguration.
UNIT –V

SOC Application studies:

SOC Design Approach, Application Study: AES, 3-D Graphics Processors, Image

Compression, Video Compression.

TEXT BOOKS:
1. Michael J. Flynn Wayne Luk, “Computer System Design System-on-
Chip”, John Wiley & Sons, 2011.
2. Steve Furber, “ARM System-on-Chip Architecture”, Addison-Wesley; 2nd

edition, 2000.

100