FIFTH SEMESTER

Course Code EC501

Course Title VLSI Design (Theory)
Type of Course Core
LT P 312
Credits 3
Course Assessment Methods
End Semester Assessment (University 50
Exam.) 50
Continuous Assessment (Sessional,
Assignments, Quiz)
Course Prerequisites Introduction to Electronics, AEC-I, AEC-II
Course Objectives (CO) 1. To understand theoreticaland practical
aspects of all the basic processes involved in
Integrated circuit fabrication technology.
2. To develop the understanding of MOSFET
physics, its design parameters and Scaling
rules.
3. To study the static characteristics, dynamic
characteristics and layout design of nMOS,
CMOS Logic, and Transmission Gate.
4. To develop the capability to analyzeCMOS
logic circuit based on Power dissipation,
Speed and Noise Margin.

Course Outcome Student will be able to:

1. Describe theoretical and practical basic
processes involved in Integrated Circuit
fabrication technology
2. Derive and interpret MOSFET Characteristics,
its design parameters and scaling rules.
3. Explain the static characteristics and dynamic
characteristics of nMOS, CMOS Logic, and
Transmission Gate.
4. Analyze and design nMOS, CMOS, and
Transmission gate circuits that meet desired
specifications.

SYLLABUS

Note for Examiner- Examiner will set 7 questions of equal marks. First question will cover whole
syllabus, having 10 conceptual questions of 184mark each or 5 questions of 2 mark each and is
compulsory. Rest of the paper will be divided into two parts having three questions each and the
candidate is required to attempt at least two questions from each part.
 SECTION-A
Monolithic IC Processes:
General classification of Integrated Circuits, advantages of ICs over Discrete Components,
Refining, and growth of silicon crystals, Si-Wafer preparation, Diffusion of dopant impurities,
Defication systems, Ion implantation, Thermal oxidation, Photolithography, Fine Line
lithography, Relative Plasma etching, Chemical Vapour Deposition (CVD), Metallization,
Packaging. (10hours)
Monolithic Components:
Epitaxial devices and their characteristics, Bipolar IC process, P-N junction Isolation, Monolithic
Bipolar transistor constructions, Dielectric isolation, Monolithic Diodes, Monolithic Junction
FETS, Monolithic resistors and Monolithic capacitors. Fabrication of MOSFET, CMOSn-well
process, Lambda based Design rules,Short channel MOS structures, MOS layers, stick
Diagramsand layout design for nMOS and CMOS technology. (10hours)
SECTION-B
Introduction to MOS Technology:
MOSFET Structure and operation, Characteristics – Threshold Voltage, Body Bias concept,
Square-Law Current-Voltage Model. Geometric Scaling Theory – Full-Voltage Scaling, Constant-
Voltage Scaling. Challenges of MOSFET Scaling – Short Channel Effects. (8hours)

MOS Inverter Design:

Resistive Load inverter Design, Comparison of depletion and enhance type MOS load.CMOS
inverter Static Characteristics: Basic Circuit Operation, static characteristics and switching
characteristics, Noise Margins.CMOS Inverter Switching Characteristics – Delay time definition
and calculation of delay time, rise time and fall time.Static Power Dissipationand Dynamic
Power Dissipation. (10hours)

CMOS Logic Design:

CMOS NAND and NOR Gate, XOR, combinational circuit, Full Adder Circuit.Basic principal of
nMOS Pass transistor, CMOS Transmission gate Logic design, Clocked-CMOS, Pre-Charge/
Evaluate Logic and Domino Logic. (7hours)

TEXT BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1. Integrated circuits K.R. Botkar Khanna
Publishers
2. CMOS Digital Integrated Sung- Mo (Steve) Kang and Yusuf Tata McGraw
Circuits Leblebici Hill
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER

85
No.
1. Principles of Microelectronics D. Nagchoudhuri, A H Wheele PHI
Technology
2. VLSI Technology Simon Sze Tata McGraw
Hill
3. Principles of CMOS VLSI Design Neil H.E. Weste and Kamran AddisonWesley
Eshraghian
4. Basic VLSI Design Douglas- A. Pucknell PHI
5. Digital Integrated Circuit Design Ken Martin OXFORD
University

Course Title VLSI Design(Practical)

Type of Course Core
Credits 1
Course Assessment Methods
Continuous Assessment 50

LIST OF EXPERIMENTS
1. Introduction to Tanner EDA Tool.
2. To study the effect of variation of Threshold voltage, Transconductance parameter,
Lambda on I-V characteristics of n-MOSFET using SPICE Level 1 MOSFET model.
3. To implement CMOS logic NANDGate, NOR Gate, XOR Gate and Full adder.
4. To study the Voltage Transfer Characteristics an nMOS inverter with resistive load and
to observe changes in the characteristics with change in value of load Resistor.
5. To study the Voltage Transfer Characteristics of CMOS inverter.
6. To compare Transient Characteristics of:
(a) nMOS Pass Transistor
(b) CMOS Pass Transistor
7. To implement Multiplexer and EXOR Gate using Pass Transistor.
8. To determine the Propagation Delay (high to low and low to high) in CMOS Logic.
9. To compare and analyze static and dynamic Power Dissipation in nMOS and CMOS
logic.
10. To implement a give Boolean expression using Dynamic CMOS Logic.

86
Course Code EC 502
Course Title Digital Signal Processing (Theory)
Type of Course Core
LT P 312
Credits 3
Course Assessment Methods
End Semester Assessment 50
(University Exam.)
Continuous Assessment 50
(Sessional, Assignments,Quiz)
Course Prerequisites Signals & Systems
Course Objectives (CO) 1. To get an introduction of basics like Sampling,
Interpolation, Aliasing and operations Convolution
and correlation.
2. To Study the basics, mathematical analysis and
applications of DTFT, DFT, FFT, DCT, and wavelet
transforms.
3. To study the design and implementation of Digital
Filters.
4. To study the analysis of multirate systems.
5. To study the architecture of DSP processors.
6. To impart practical knowledge of signal processing
operations in MATLAB.
Course Outcome 1. Explain the properties of discrete time systems
2. Analyze Continuous and Discrete time systems using
different types of Transforms.
3. Design and Implement FIR and IIR Digital filters.
4. Explain multi-rate systems and DSP processors.

SYLLABUS
Note for Examiner- Examiner will set 7 questions of equal marks. First question will cover
whole syllabus, having 10 conceptual questions of 1 mark each or 5 questions of 2 mark each
and is compulsory. Rest of the paper will be divided into two parts having three questions
each and the candidate is required to attempt at least two questions from each part.

SECTION-A
Introduction:
Classification of Discrete-time Signals & Systems, The Sampling Theorem, Reconstruction
using Interpolation filter, Aliasing, Stability and Causality, Convolution of discrete time signals,

87
 Correlation of Discrete time signals, Solution of Linear constant coefficient difference
equations, Review of Z-transform. (7hours)

Frequency Domain Representation of Signals & Systems:

Review of DTFT, Discrete Fourier Transform and its properties, Filtering of long data
sequences, Divide and Conquer approach to computation of DFT, Fast Fourier Transform,
Decimation in time and Decimation in frequency algorithms, Computations Complexity
Calculations, Discrete Cosine Transform, Audio & Video Coding, JPEG coding, Time-Frequency
Analysis, Wavelet Transform. inverse dft (15hours)

SECTION-B
Digital Filters:
Ideal Filter vs Practical Filters, General Specifications and Design Steps, Comparison of FIR &
IIR Filters, Design of FIR Filters using Window technique, Frequency sampling technique,
Design of IIR Filters using Impulse Invariance technique, Bilinear Transformation, Design of IIR
Filters using Butterworth, Chebyshev and Elliptic filter, Digital frequency transformation.
(9hours)

Implementation of Discrete Time Systems:

Block diagrams and signal flow graphs for FIR and IIR systems, Direct form, Cascade form,
Frequency Sampling Structures, and Lattice structures for FIR systems, Direct form, Cascade
form, Parallel form, and Lattice and Lattice-Ladder Structures for IIR systems, Representation
of fixed point and floating point numbers, Finite word length effects.
(5hours)
Multirate Signal Processing:
Basic Sampling rate alteration devices, Time domain and frequency domain representation,
Multirate structures, Multistage design, Polyphase decomposition. (7hours)

Processors:
Architecture of TMS320CXX series, Addressing modes, Memory management. (2hours)

TEXT BOOKS
S. No. NAME AUTHOR(S) PUBLISHER
1. Digital Signal Processing: Proakis & Manolakis Pearson Education
Principles, Algorithms and Ltd . 4th edition
Applications
RECOMMENDED BOOKS
S. No. NAME AUTHOR(S) PUBLISHER
1. Digital Signal Processing E C Ifeacher and B W Jervis Pearson

88
 2. Digital Signal Processing A.V Oppenheim and Pearson Education
R.W.Schafer Ltd

3. Digital Signal Processing Sanjit and Mitra Tata Mcgraw Hill

4. Digital Signal Processing S Salivahanan, A Vallavraj, C Tata Mcgraw Hill

Gnanapriya

5. Digital Signal Processing E C Ifeacher and B W Jervis Pearson

Course Title Digital Signal Processing (Practical)

Type of Course Core
Credits 1
Course Assessment
Methods 50
Continuous Assessment

LIST OF EXPERIMENTS
(To be performed using any simulation software like MATLAB, Scilab or equivalent)
1. Introduction to Simulation Software.
2 Effect of noise on signals.
3 Z-Transform.
4 Convolution of sequences.
5 Correlation of sequences.
6 Detection of Signals buried in Noise.
7 System Response to Arbitrary Inputs
8 DFT & IDFT of two sequences
9 FFT of two Sequences
10 Circular Convolution
11 Overlap-add method and overlap-save methods
12 FIR Filter Design.
13 IIR Filter Design.
14 Interpolation and Decimation of sequences
15 Implementation of digital filter banks
16 System Design based on DSP kits

89
Course Code EC503
Course Title Antennas & Wave Propagation(Theory)
Type of Course Core
LT P 300

Credits 3
Course Assessment Methods
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional,
Assignments, Quiz) 50
Course Prerequisites Physics, Electromagnetic Theory
Course Objectives (CO) 1. To provide an in depth understanding of
basic antenna parameters.
2. To provide in depth study for the analysis and
design of antenna arrays.
3. To provide in depth study of Yagi-Uda array,
log periodic array, and Dolph-Techebysheff
arrays.
4. To provide in depth study of Practical
Antennas such as rhombic antennas, ferrite
rod, whip antennas.
5. To provide in depth study of special antennas
such as frequency independent antennas and
receiving antennas.
6. To study the effect of propagation of radio
waves in actual environment.
Course Outcome 1. Explain basic Antenna parameters.
2. and special Analyze and design of antenna
arrays.
3. Describe and analyze design parameters
related to practical antennas antennas.
4. Explain the concept of propagation of radio
waves.

SYLLABUS
Note for Examiner- Examiner will set 7 questions of equal marks. First question will cover whole
syllabus, having 10 conceptual questions of 1 mark each or 5 questions of 2 mark each and is
compulsory. Rest of the paper will be divided into two parts having three questions each and the
candidate is required to attempt at least two questions from each part.

SECTION-A
Antenna Radiation:
90
Antenna Parameters: Antenna impedance, Directional patterns, Effective length, Radiation
Intensity, Directivity, Power gain, Efficiency, Effective area, Equivalent circuit, Front to back
ratio, polarization and antenna temperature, Radiation field, Radiation power, Radiation
resistance, Directivity and gain of an alternating current element, half wave dipole and quarter
wave monopole, Effect of earth on patterns. (15hours)
Antenna Arrays:
Multiplication of patterns, one dimensional broadside and endfire arrays, Feed network for
arrays: series, shunt, delta matching, Impedance matching: Folded dipole, BALUNS and stubs,
Yagi Uda array, log-periodic arrays, Dolph-Techebysheff arrays (10hours)
SECTION-B
Practical Antennas:
Top loading and tuning, rhombic antennas, ferrite rod, whip antennas, Receiving antennas,
frequency independent antennas.(08hours)
Wave Propagation:
Modes of Propagation: Surface Wave Propagation, Sky Wave (Ionospheric) Propagation- Virtual
height, Maximum usable Frequency, Skip Distance, Optimum working frequency, Space Wave
(Tropospheric) Propagation- line of sight distance.(12hours)

TEXT BOOKS
S. NAME AUTHOR PUBLISHER
No.
1 Antennas and Radio Wave Propagation K D Prasad Satya Prakashan
RECOMMENDED BOOKS
1 Antennas and Wave Propagation G S N Raju Pearson
2 Antenna and Radio Wave Propagation Collin R.E Mc-Graw Hill.
3 Antenna and Radio Wave Propagation Krauss TMH

4 Antenna and Radio Wave Propagation Ballanis John Wiley & Sons

91
Course Code EC505
Course Title Digital System Design (Theory)
Type of Course Core
LT P 312
Credits 3
Course Assessment Methods
End Semester Assessment (University 50
Exam.)
Continuous Assessment (Sessional, 50
Assignments, Quiz)
Course Prerequisites Basic Electronics, Digital Electronics
Course Objectives (CO) 1. To familiarize with basics of switching algebra
using theorems and devise various minimization
techniques for single and multi-output
combinational functions.
2. To understand the need for error correction and
error detection techniques.
3. To use and analyze various fault detection and
correction techniques for combinational and
sequential circuits.
4. To introduce the concept of Finite state machine
and use it for minimization of completely and
incompletely specified synchronous and
asynchronous sequential circuits.
5. To draw and analyze ASM charts and learn the
concept of races, cycles and hazards.
6. To impart practical knowledge of digital system
design.
Course Outcome 1. Recall and explain the concepts about
combinational and sequential circuits.
2. Experiment with various minimization techniques
(like K-maps, Q-M methods, Iterative method,
Variable-entered mapping) to design optimal
combinational circuits.
3. Construct and analyze Finite State Machines for
synchronous and asynchronous sequential circuits.
4. Identify and discuss the methods to find faults and
errors for detection and location in combinational
and sequential circuits.

SYLLABUS
Note for Examiner- Examiner will set 7 questions of equal marks. First question will cover whole
syllabus, having 10 conceptual questions of 1 mark each or 5 questions of 2 mark each and is
92
compulsory. Rest of the paper will be divided into two parts having three questions each and the
candidate is required to attempt at least two questions from each part.

SECTION-A
Combinational Circuits:
Review of switching algebra: Definitions, Theorems, Functions of n variable, Logic Detailed
Diagram and Symbols minimization, Minimization Techniques: optimal combinations with K-map
and tabular methods, simplification & minimization, complimentary approach with map method,
map method for multi-output functions, Tabular and Iterative consensus method for obtaining
prime implicants for single and multi-output functions.
Error Correction and Detection:
Error detection and correction techniques, Single error detection, Single error correction with
double error
Fault detection and Location in combinational circuits:
Different methods of detecting and locating Faults in combinational circuits.
(20hours)
SECTION-B
Sequential Circuits: Synchronous circuits: Concept of state diagram and state table, state
assignment, Analysis and synthesis of sequential circuits, designs of Next state decoder and
output decoder, state reduction, Machine minimization of completely and incompletely
specified machines.
Asynchronous Circuits: Analysis and Synthesis of Asynchronous circuits, Races and Cycles,
hazards in asynchronous circuits. Sequential Machine Flow Charts, synthesis using sequential
machine flow charts.
Fault detection and Location in sequential circuits.
(25hours)

TEXT BOOKS
S. No. NAME AUTHOR(S) PUBLISHER
1. Switching and Finite Automata Theory Kohavi TMH
2. Digital circuits and Logic Design Lee PHI

93
Course Title Digital System Design (Practical)
Type of Course Core
Credits 1
Course Assessment Methods
Continuous Assessment 50

LIST OF EXPERIMENTS

1. To Design and test the minimized circuit of Full Adder.

2. To Design and test the minimized circuit of BCD to Binary Converter
3. Implement decade counter using minimum number of gates
4. To test the minimized circuit of Decimal to BCD Encoder
5. Design and test hexadecimal to binary Encoder
6. Implement and test BCD to 7-Segment decoder
7. Design a sequence detector to detect a given sequence
8. Design and test twisted type ring counter
9. Implement the minimized circuit of Modulo-6 counter
10. To design, implement and test a 16:4 multiplexer using logic gates.
11. To design, implement and test a 4:16 demultiplexer using logic gates.
12. Design & test Johnson Counter.

94
Course Code EC506
Course Title Advanced Microcontrollers & Applications
(Theory)
Type of Course Core
LT P 302
Credits 3
Course Assessment Methods
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional,
Assignments, Quiz) 50
Course Prerequisites Microprocessor
Course Objectives (CO)

Course Outcome
Note for Examiner- Examiner will set 7 questions of equal marks. First question will cover
whole syllabus, having 10 conceptual questions of 1 mark each or 5 questions of 2 mark
each and is compulsory. Rest of the paper will be divided into two parts having three
questions each and the candidate is required to attempt any two questions from each part.

Section A

Introduction to Embedded System:

Define basic concept of embedded system, Explain Characteristics of embedded system,
Operating System (OS): Types of OS, Types of Mobile OS, Characteristics of Real Time
Operating System, Compare different Operating Systems used for embedded system
designing.

8-bit Microcontrollers Architecture (Atmega 8, AVR):

Microcontroller Types: PIC, AVR, ARM: features and applications, Compare different micro
controllers used for embedded system designing, AVR microcontroller: Types , Architecture
and functional diagram, Internal Architectural, Block diagram of controller (Atmega 8), pin
diagram, Configuration of Two 8-bit and One 16-bit Timers and Counters, channel ADC
Working, Essential Peripheral circuits: Crystal Circuit, Power supply, Oscillator Circuit, Initial
programming configurations of Atmega8: port, counter, timer, Bootloader Circuit, ISP of
Atmega 8 and Tmega8 and ATmea328

Section B
Open Source Embedded Development Board (Arduino):
Overview of open source embedded development board (Arduino), Explain working of open
source embedded development board using block diagram, Identify pins of embedded
development board, circuit diagram of open source embedded Hardware, features of open
source tool used for programming a development board, programming of embedded

95
development board, Interface Serial Port with embedded development board, Basic Circuit
of embedded development Board

Interface Digital and Analog I/O Devices (Arduino Interfacing): Concept of input and output
port of embedded development board (Arduino Interfacing Concept), Interfacing of Digital
I/O devices with program (Digital I/O Interfacing), Interfacing of Analog I/O devices program
(Analog I/O Interfacing ), Interfacing of Keypad with programming (Keypad Interfacing).
Interfacing of Serial port with programming (Serial Port Interfacing), Interfacing of DC motor
with programming, Interfacing of 16x2 LCD with programming

Embedded system Applications (Arduino): functional blocks of Line follower Robot using
Arduino, functional blocks of accelerometer based gesture control robot, functional blocks
of home automation using RF control.

TEXT BOOKS
S. No. Title Author(s) Publisher
1. Exploring Arduino Jeremy Blum. Wiley

2. 30 Arduino Projects for Evil Genius Simon Monk McGraw-Hill

Professional
3 AVR Microcontroller and Muhammad Ali Mazidi, Pearson Education
Embedded Systems using Sarmad Naimi, Sepehr
Assembly and C Naimi
RECOMMENDED BOOKS
4 Make: Arduino Bots and Gadgets Kimmo and Tero Karvine O’REILLY
5 Arduino Cookbook Michael Margolis O’REILLY
6 Arduino Internas Dale Wheat Technology in
Action

96
Course Title Advanced Microcontrollers & Applications
(Practical)
Type of Course Core
Credits 1
Course Assessment Methods 50
Continuous Assessment
List of Experiments:
1. Test AVR Micro-Controller Architecture.
2. Identify each block of ATmega8 with Pins.
3. Use Arduino Architectural diagram .
4. Test the different Arduino Boards, Open-Source and Arduino Shields.
5. Install Arduino IDE and its development tool.
6. Design an embedded development Board.(arduino)
7. Develop a program to Blink LED for 1second.
8. Develop a program to interface Input Switches and output LEDs with development
board (arduino).
9. Interface 7 seg display with development board(arduino) and Write a program to
count and display 0 to 9 on it.
10. Develop a program to generate led pattern using computer serial control.
11. Interface potentiometer with development board (arduino) and write a program to
generate Led pattern on it.
12. Interface LM35 temperature sensor with arduino and monitor temp. on serial
monitor.
13. Interface DC motor using L293D Motor Driver.
14. Interface RF Tx/RF Rx with Arduino
15. Interface 16x2 LCD and Display “HELLO WORLD”.
16. Make Line-Follower Robot using Arduino.
17. Build Digital thermometer using LM35 and LCD 16x2.
18. Build Gesture Control Robot using Accelerometer.

97
Course Code EC507
Course Title Data Structures & Algorithms (Theory)
Type of Course Elective
LT P 300
Credits 3
Course Assessment Methods
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional, 50
Assignments, Quiz)
Course Prerequisites Object Oriented Programming
Course Objectives (CO) 1. To develop an in depth understanding of
various Data Structures such as stacks,
queues, linked lists, trees and graphs.
2. To help students select an appropriate data
structure for a particular application and
design the algorithm to manipulate the data
structure.
3. To analyze the complexity of various
algorithms.
Course Outcome 1. Describe the usage of various data
structures and explain algorithm’s
complexity.
2. Recognize basic operations and design
algorithms for arrays, stacks and queues.
3. Describe basic operations and design
algorithms for various types of linked lists.
4. Explain operations on various types of trees
and their applications.
5. Examine graphs, their applications and
various sorting and searching algorithms.

SYLLABUS

Note for Examiner- Examiner will set 7 questions of equal marks. First question will cover whole
syllabus, having 10 conceptual questions of 1 mark each or 5 questions of 2 mark each and is
compulsory. Rest of the paper will be divided into two parts having three questions each and the
candidate is required to attempt at least two questions from each part.

SECTION-A

98
Introduction
Introduction to data structures, Introduction to Algorithms Complexity. (02hours)
Arrays, Stacks & Queues
Concepts; Basic operations & their algorithms: Transverse, Insert, Delete, Sorting of data in these
data structures; Prefix, Infix, Postfix Notations. (08hours)

Lists
Concepts of Link List and their representation; Two way lists; Circular link list; Basic operations &
their algorithms: Transverse, Insert, Delete, Searching and Sorting of data in List; Storage
Allocation & Garbage Collection; Linked stack and queues; Generalized List; sparse matrix
representation using generalized list structure. (11hours)

SECTION-B
Trees
Binary Trees and their representation using arrays and linked lists, Trees and their applications,
Binary tree transversal, Inserting, deleting and searching in binary trees, Heap & Heap Sort,
General Trees, Thread binary tree, Height balance Tree (AVL), B-Tree. (08hours)

Graphs and their applications

Graphs, Linked Representation of Graphs, Graph Traversal and spanning forests, Depth first
search, Breadth first search. (08hours)

Sorting & Searching

Insertion sort, Selection sort, Merging, Merge sort, Radix sort, Sequential & Binary Search,
Indexed Search, Hashing schemes, Binary search Tree. (08hours)

TEXT BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1. Theory and problems of Data Seymour Lipschutz McGraw Hill
Structures
RECOMMENDED BOOKS
1. Data Structure Using C and C++ A. Tenenbaum, Y. Langsam, PHI, Edition 2nd
M. J. Augenstein
2. Data Structures & Program Design Robert L. Kruse PHI , Edition 3rd

99