1 Euler Graph Using Euler graph to draw layout. 2 Graph Representation Graph consists of vertices and edges. Circuit node = vertex. Transistor = edge.

Slides:



Advertisements
Similar presentations
Logical Functions Circuits using NMOS and PMOS enhancement mode FETs.
Advertisements

Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
COMBINATIONAL LOGIC [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]
S.N.Bhat, Faculty, Dept. of E&C Engineering, M.I.T Manipal
EE 414 – Introduction to VLSI Design
Circuit Extraction 1 Outline –What is Circuit Extraction? –Why Circuit Extraction? –Circuit Extraction Algorithms Goal –Understand Extraction problem –Understand.
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.
Lecture #26 Gate delays, MOS logic
Optimal Layout of CMOS Functional Arrays ECE665- Computer Algorithms Optimal Layout of CMOS Functional Arrays T akao Uehara William M. VanCleemput Presented.
Lecture #24 Gates to circuits
Prelab: MOS gates and layout
Combinational MOS Logic Circuit
Homework collection Thursday 3/29 Read Pages 160 – 174 Page 185: 1, 3, 6, 7, 8, 9, 12 a-f, 15 – 20.
4/17/2017 Section 8.5 Euler & Hamilton Paths ch8.5.
Complex CMOS Logic Gates
© Digital Integrated Circuits 2nd Sequential Circuits Cascading Dynamic Gates  Dynamic gates rely on temporary capacitive storage, while static gates.
Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
CMOS Invertors Lecture #3. Step 1: Select Foundary.
1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.
Module-3 (MOS designs,Stick Diagrams,Designrules)
EGRE 427 Advanced Digital Design Figures from Application-Specific Integrated Circuits, Michael John Sebastian Smith, Addison Wesley, 1997 Chapter 7 Programmable.
L-EDIT Tutorial EEL 4310.
5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.
Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.
Graph Theory & Networks Name:____________Date:______ Try to trace each figure below without lifting your pencil from the paper and without retracing any.
Notices You have 18 more days to complete your final project!
Penn ESE370 Fall Townley & DeHon ESE370: Circuit-Level Modeling, Design, and Optimization for Digital Systems Day 13: October 5, 2011 Layout and.
ECE442: Digital ElectronicsSpring 2008, CSUN, Zahid Static CMOS Logic ECE442: Digital Electronics.
ECE2030 Introduction to Computer Engineering Lecture 4: CMOS Network Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia Tech.
Schematic Diagrams Schematic diagrams are used to graphically represent the components and interconnections of electrical circuits. Electronic schematics.
Exercise TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.
STICK DIAGRAM EMT251. Schematic vs Layout In Out V DD GND Inverter circuit.
Examples Euler Circuit Problems Unicursal Drawings Graph Theory
EE141 © Digital Integrated Circuits 2nd Devices 1 Goal of this lecture  Present understanding of device operation  nMOS/pMOS as switches  How to design.
CMOS Fabrication nMOS pMOS.
1.5 Graph Theory. Graph Theory The Branch of mathematics in which graphs and networks are used to solve problems.
Graphs A ‘Graph’ is a diagram that shows how things are connected together. It makes no attempt to draw actual paths or routes and scale is generally inconsequential.
STICK DIAGRAM EMT251. Schematic vs Layout In Out V DD GND Inverter circuit.
Purpose of design rules:
Spring 2015 Mathematics in Management Science Network Problems Networks & Trees Minimum Networks Spanning Trees Minimum Spanning Trees.
1 Contents Reviewed Rabaey CH 3, 4, and 6. 2 Physical Structure of MOS Transistors: the NMOS [Adapted from Principles of CMOS VLSI Design by Weste & Eshraghian]
1 Overview of Fabrication Processes of MOSFETs and Layout Design Rules.
Graph theory and networks. Basic definitions  A graph consists of points called vertices (or nodes) and lines called edges (or arcs). Each edge joins.
Chapter 6: Graphs 6.1 Euler Circuits
Review Euler Graph Theory: DEFINITION: A NETWORK IS A FIGURE MADE UP OF POINTS (VERTICES) CONNECTED BY NON-INTERSECTING CURVES (ARCS). DEFINITION: A VERTEX.
Norhayati Soin 05 KEEE 4425 WEEK 7/1 23/8/2005 LECTURE 9: KEEE 4425 WEEK 7 CMOS LAYOUT AND STICK DIAGRAM (Cont’d)
Static CMOS Logic Seating chart updates
Solid-State Devices & Circuits
STICK DIAGRAM EMT251. Schematic vs Layout In Out V DD GND Inverter circuit.
CMOS Logic Gates. NMOS transistor acts as a switch 2 When gate voltage is 0 V No channel is formed current does not flow easily “open switch” When gate.
1) Find and label the degree of each vertex in the graph.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Circuit Delay Performance Estimation Most digital designs have multiple signal paths and the slowest one of these paths is called the critical path Timing.
EE141 Manufacturing 1 Chapter 2 Manufacturing Process and CMOS Circuit Layout 1 st rev. : March 7, nd rev. : April 10, 2003.
Stick Diagrams Stick Diagrams electronics.
CSE477 L06 Static CMOS Logic.1Irwin&Vijay, PSU, 2003 CSE477 VLSI Digital Circuits Fall 2003 Lecture 06: Static CMOS Logic Mary Jane Irwin (
Cell Design Standard Cells Datapath Cells General purpose logic
THE CMOS INVERTER.
Layout of CMOS Circuits
STICK Diagrams UNIT III : VLSI CIRCUIT DESIGN PROCESSES VLSI DESIGN
CSE477 VLSI Digital Circuits Fall 2002 Lecture 06: Static CMOS Logic
Spanning Trees Discrete Mathematics.
Where are we? Lots of Layout issues Line of diffusion style
COMBINATIONAL LOGIC DESIGN
EENG447 Digital IC Design Dr. Gürtaç Yemişcioğlu.
ECE 424 – Introduction to VLSI Design
CMOS Layers n-well process p-well process Twin-tub process.
Warm Up – 3/17 - Monday A) List the set of vertices.
Chapter 6 (I) CMOS Layout of Complexe Gate
Presentation transcript:

1 Euler Graph Using Euler graph to draw layout

2 Graph Representation Graph consists of vertices and edges. Circuit node = vertex. Transistor = edge Verify that graph represents PDN:

3 Building PUN from PDN Place PUN vertices (empty circles) in each confined area in PDN Connect PUN vertices with edges that cross the PDN graph edges JUST ONCE

4 Graph Theory Define Euler path – Uninterrupted path that traverses each edge of the graph EXACTLY ONCE Find Euler path in PDN graph below starting at x.

5 Optimal Input (POLY) Ordering Common Euler path in BOTH PDN graph and PUN graph gives optimal ordering of POLY What is the order of inputs for the common Euler paths?

6 Optimized Stick Layout

7 Two steps of stick diagram drawing Method: Stick diagrams are constructed in two steps. 1) The first step is to construct a logic graph of the schematic. A) Identify each transistor by a unique name of its gate signal (A, B, C, D, E in the example of the following Figure). B) Identify each connection to the transistor by a unique name (1,2,3,4 in the example of the Figure).

8 Two steps of stick diagram drawing F) It may be necessary to redefine the function to find a Euler path. i) F = E + (CD) + (AB) = (AB) +E + (CD) 2) The second step is to construct one Euler path for both the Pull up and Pull down network A) Euler paths are defined by a path that traverses each node in the path, such that each edge is visited only once. B) The path is defined by the order of each transistor name. i) If the path traverses transistor A then B then C. Then the path name is {A, B, C} C) The Euler path of the Pull up network must be the same as the path of the Pull down network. D) Euler paths are not necessarily unique.

9 Example

10 Using Euler Graph to draw stick diagram 3) Once the Euler path is found it is time to lay out the stick diagram. A) Trace two green lines horizontally to represent the NMOS and PMOS devices. B) Trace the number of inputs (5 in this example) vertically across each green strip. These represent the gate contacts to the devices that are made of Poly. C) Surround the NMOS device in a yellow box to represent the surrounding Pwell material. D) Surround the PMOS device in a green box to represent the surrounding Nwell material. E) Trace a blue line horizontally, above and below the PMOS and NMOS lines to represent the Metal 1 of V DD and V SS. F) Label each Poly line with the Euler path label, in order from left to right. G) Place the connection labels upon the NMOS and PMOS devices. i) In the example, the connection labels are 1, 2, 3, 4. Connection 1 is the node that lies between the PMOS transistors A, B and E. The Euler path defines the transistor ordering of {A, B, E, D, C} therefore, transistor B is physically located beside transistor E. Place the connection label 1 between the transistors B and E. Later, we will route a Metal 1 connection from the drain of transistor A to the connection label of 1. ii) Connection 2 is the node that connects the PMOS transistors of E, D, and C. Since the Euler path places transistors E and D next to each other, place the connection label between these two. Later, we will route a Metal 1 strip from the source of C to connection label 2. iii) Connection label 3 lies between the NMOS transistors of A and B. iiii) Connection label 4 lies between the NMOS transistors of D and C.

11

12 H) Place the V DD, V SS and all output names upon the NMOS and PMOS devices. i) For the example of Figure there is only one output signal, called output. a) This signal is connected to the PUP device through a node located between transistors D and C. b) The signal is connected to the PDN at the node that the three transistors of A, E and D share. The Euler graph connects transistors E and D together so an output connection will be located there. Transistor A has one remaining contact that is unused, so the output label is placed at that position. ii) V DD is located upon the PMOS device at the node shared between transistors A and B. iii) V SS is located upon the NMOS device at a node that is shared between transistors B, E and C. a) The Euler path places transistors B and E together so place a V SS label between the transistors there. b) Transistor C has one remaining contact that is unused. Place a V SS label there. I) Place a blue line on the diagram to represent the output metal one material (Figure 4). Note: this line may have to be moved around depending on how the diagram connections will lay out.

13

14 4) Now its time to interconnect the device. You will probably have to experiment to find the best routing. A) Notice that Poly and Metal 1 can overlap. B) Avoid routing signals that are side by side for long lengths. This adds capacitance to the device. C) Avoid all interconnect overlap if possible. This adds capacitance to the device. D) Strive for simplicity. This will later provide the smallest and fastest devices. E) You can use Poly, Metal 2, and even Active to interconnect your device. i) Poly and especially Active adds resistance to you device. ii) Avoid using Metal 2 if possible. Metal 2 is another layer to your device that you will probably need in the next heiarchy up.

مثال

16 مثال 12 3 F V DD F V SS A C D B Euler Path: (A,B,D,C)

17

18 مثال: X=? X=ab+cd

19