Integrated Circuits and Systems group, IIT Madras

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

- Both sides previous revision Previous revision
Next revision
- courses:ee5311_2019 [2019/09/13 16:20] janakiraman
+ Previous revision
+ courses:ee5311_2019 [2019/11/06 18:33] (current) janakiraman
@@ Line -76,4 +76,7 @@ removed created
 
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​lecture_notes/​module-1/​ee5311-module-1-transistor.pdf|Lecture Slides]]
 
 ===== Tutorial-1 - The Transistor =====
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​tutorials/​ee5311-tut-1.pdf|Tutorial-1]]
 
 ===== Module-2 - Interconnects =====
@@ Line -121,4 +124,95 @@ removed created
 
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​lecture_notes/​module-3/​ee5311-module-3-inverter.pdf|Lecture Slides]]
 
 ===== Tutorial-2 - The Inverter =====
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​tutorials/​ee5311-tut-2.pdf|Tutorial-2]]
 
 ===== Module-4 - Combinational Circuit Design =====
 
 **Learning Objectives**:​
    - Explain logical effort (LE) and electrical effort (EE)
   - Derive the optimum number of buffers with their sizes to drive a load.  ​
   - Implement any arbitrary boolean function in Static CMOS logic 
   - Derive logical effort for any gate built in any style of logic
   - Optimize the path delay of arbitrary gates driving a load capacitance
   - Implement logic functions using ratio'​d logic and dynamic logic
   - Use the pass transistor to implement simple gates like MUX and XORs 8. Explain basic domino logic
 
 **Contents**:​
   - CMOS gates
   - Gate sizing
   - Capacitance estimation
   - Delay estimation
   - Logical effort
   - Path delay optimizaion
   - Buffer insertion ​
   - Circuit Families
     - Static CMOS
     - Ratioed gates
     - Cascode Voltage Switch Logic (CVSL) & Level Translators
     - Dynamic circuits
     - Pass Transistor circuits
 
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​lecture_notes/​module-4/​ee5311-module-4-comb-ckt.pdf|Lecture Slides]]
 
 ===== Tutorial-3 - Combinational Circuits =====
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​tutorials/​ee5311-tut-3.pdf|Tutorial-3]]
 
 ===== Module-5 - Sequential Circuits =====
   - Build elementary sequential circuits like latches and flip flops - Static and Dynamic
   - Identify devices that affect set up and hold time
   - Derive max and min delay constraints for latch/ flip flop based pipeline systems
   - Account for clock skew in a pipelined system
   - Analyze time borrowing across half cycles and across cycles
   - Calculate the maximum clock frequency of operation of a pipelined system
 
 **Contents**:​
   - Sequencing Elements
   - Sequencing Methods
     - Flip flop
     - Latch
   - Delay definitions
   - Circuit Implementations of Latch/ Flop
     - Static ​
     - Dynamic
   - Max delay constraints
   - Min delay constraints
   - Time Borrowing  ​
 
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​lecture_notes/​module-5/​ee5311-module-5-seq-ckt.pdf|Lecture Slides]]
 
 ===== Tutorial-4 - Sequential Circuits =====
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​tutorials/​ee5311-tut-4.pdf|Tutorial-4]]
 
   ​
   ​
 ===== Module-6 - Adders and Multipliers =====
 **Learning Objectives**:​
   - Design a full adder with least PMOS stack size using self duality principle
   - Construct adder architectures to reduce delay from O(N) to O(\sqrt{N}) - O(log(N))
   - Draw timing diagrams to show the signal propagation of various adders ​
   - Design an array multiplier for both signed and unsigned multiplication
   - Optimize the arrary multiplier using the inverting property of a Full Adder
   - Derive the Modified Booth Encoding to reduce the number of partial products
   - Design and implement a multipler based on the Modified Booth Encoding algorithm
 
 **Contents**:​
   - Adders
     - Basic terminology
     - Full adder circuit design
     - Inverting Adder
     - Carry Save Adder
     - Carry Select Adder
     - Carry Look Ahead Adder
   - Multipliers
     - Basic Terminology
     - Booth and Modified Booth Encoding
     -  2s Complement Arithmetic ​
     - Array Multiplier
     - Carry Save Multipler
     - Signed multiplication and carry save implementation
     - Final Addition
 [[http://​www.ee.iitm.ac.in/​~janakiraman/​courses/​EE5311/​lecture_notes/​module-6/​ee5311-module-6-adder-mult.pdf|Lecture Slides]]