COMBINATIONAL LOGIC [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]

Slides:



Advertisements
Similar presentations
ECE555 Lecture 5 Nam Sung Kim University of Wisconsin – Madison
Advertisements

Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
COMBINATIONAL LOGIC DYNAMICS
Designing Static CMOS Logic Circuits
CMOS Circuits.
Digital CMOS Logic Circuits
Static CMOS Circuits.
EE 414 – Introduction to VLSI Design
Progettazione di circuiti e sistemi VLSI La logica combinatoria
Elettronica T A.A Digital Integrated Circuits © Prentice Hall 2003 Inverter CMOS INVERTER.
Combinational Circuits
Microelectronic Circuits, Sixth Edition Sedra/Smith Copyright © 2010 by Oxford University Press, Inc. C H A P T E R 13 CMOS Digital Logic Circuits.
Designing Combinational Logic Circuits: Part2 Alternative Logic Forms:
Lecture #26 Gate delays, MOS logic
Copyright 2001, Regents of University of California Lecture 18: 04/0703 A.R. Neureuther Version Date 04/03/03 EECS 42 Intro. electronics for CS Spring.
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
Combinational MOS Logic Circuit
Lecture #25 Timing issues
Digital Integrated Circuits A Design Perspective
Digital CMOS Logic Circuits
Digital Integrated Circuits A Design Perspective
S. RossEECS 40 Spring 2003 Lecture 24 Today we will Review charging of output capacitance (origin of gate delay) Calculate output capacitance Discuss fan-out.
Digital Integrated Circuits© Prentice Hall 1995 Combinational Logic COMBINATIONAL LOGIC.
Field-Effect Transistors 1.Understand MOSFET operation. 2. Understand the basic operation of CMOS logic gates. 3. Make use of p-fet and n-fet for logic.
Lecture 21, Slide 1EECS40, Fall 2004Prof. White Lecture #21 OUTLINE –Sequential logic circuits –Fan-out –Propagation delay –CMOS power consumption Reading:
1 Delay Estimation Most digital designs have multiple data paths some of which are not critical. The critical path is defined as the path the offers the.
Mary Jane Irwin ( ) Modified by Dr. George Engel (SIUE)
Mary Jane Irwin ( ) CSE477 VLSI Digital Circuits Fall 2002 Lecture 04: CMOS Inverter (static view) Mary Jane.
Ch 10 MOSFETs and MOS Digital Circuits
Review: CMOS Inverter: Dynamic
EE415 VLSI Design DYNAMIC LOGIC [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]
Elmore Delay, Logical Effort
CMOS Digital Integrated Circuits
1 Euler Graph Using Euler graph to draw layout. 2 Graph Representation Graph consists of vertices and edges. Circuit node = vertex. Transistor = edge.
Notices You have 18 more days to complete your final project!
Outline Introduction CMOS devices CMOS technology CMOS logic structures CMOS sequential circuits CMOS regular structures.
EE141 © Digital Integrated Circuits 2nd Combinational Circuits 1 Digital Integrated Circuits A Design Perspective Designing Combinational Logic Circuits.
ECE442: Digital ElectronicsSpring 2008, CSUN, Zahid Static CMOS Logic ECE442: Digital Electronics.
Designing Combinational Logic Circuits
Universidade Federal de Santa Catarina Centro Tecnológico Computer Science & Electrical Engineering Lectures 33 to 36 Combinational Circuits in CMOS Digital.
Chapter 6 (I) Designing Combinational Logic Circuits Static CMOS
Linear Delay Model In general the propagation delay of a gate can be written as: d = f + p –p is the delay due to intrinsic capacitance. –f is the effort.
CSE477 L07 Pass Transistor Logic.1Irwin&Vijay, PSU, 2003 CSE477 VLSI Digital Circuits Fall 2003 Lecture 07: Pass Transistor Logic Mary Jane Irwin (
EE141 © Digital Integrated Circuits 2nd Devices 1 Goal of this lecture  Present understanding of device operation  nMOS/pMOS as switches  How to design.
Digital Integrated Circuits A Design Perspective
Combinatorial Logic Circuits
EE141 Combinational Circuits 1 Chapter 6 Designing Combinational Logic Circuits November 2002.
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]
EE141 © Digital Integrated Circuits 2nd Combinational Circuits 1 Digital Integrated Circuits A Design Perspective Designing Combinational Logic Circuits.
Static CMOS Logic Seating chart updates
EE141 © Digital Integrated Circuits 2nd Combinational Circuits 1 A few notes for your design  Finger and multiplier in schematic design  Parametric analysis.
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.
EE415 VLSI Design. Read 4.1, 4.2 COMBINATIONAL LOGIC.
EE534 VLSI Design System Summer 2004 Lecture 12:Chapter 7 &9 Transmission gate and Dynamic logic circuits design approaches.
Dynamic Logic.
1 Dynamic CMOS Chapter 9 of Textbook. 2 Dynamic CMOS  In static circuits at every point in time (except when switching) the output is connected to either.
EE141 Combinational Circuits 1 Chapter 6 (I) Designing Combinational Logic Circuits Dynamic CMOS LogicDynamic CMOS Logic V1.0 5/4/2003.
EE141 Combinational Circuits 1 Chapter 6 (I) Designing Combinational Logic Circuits Static CMOSStatic CMOS Pass Transistor LogicPass Transistor Logic V1.0.
CSE477 L11 Fast Logic.1Irwin&Vijay, PSU, 2002 CSE477 VLSI Digital Circuits Fall 2002 Lecture 11: Designing for Speed Mary Jane Irwin (
EE 466/586 VLSI Design Partha Pande School of EECS Washington State University
EE141 Manufacturing 1 Chapter 2 Manufacturing Process and CMOS Circuit Layout 1 st rev. : March 7, nd rev. : April 10, 2003.
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
STICK Diagrams UNIT III : VLSI CIRCUIT DESIGN PROCESSES VLSI DESIGN
CSE477 VLSI Digital Circuits Fall 2002 Lecture 06: Static CMOS Logic
COMBINATIONAL LOGIC.
COMBINATIONAL LOGIC DESIGN
COMBINATIONAL LOGIC - 1.
Chapter 6 (I) CMOS Layout of Complexe Gate
Presentation transcript:

COMBINATIONAL LOGIC [Adapted from Rabaey’s Digital Integrated Circuits, ©2002, J. Rabaey et al.]

Overview Simple complementary MOS gates Construction of complex CMOS gates VLSI cell design methodology Standard cells Stick diagrams Euler path Delays Transistor sizing Fan-in and fan-out considerations

Combinational vs. Sequential Logic Output = f ( In ) Output = f ( In, Previous In )

Static Complementary CMOS Pull-up network (PUN) and pull-down network (PDN) VDD F(In1,In2,…InN) In1 In2 InN PUN PDN … PMOS transistors only pull-up: make a connection from VDD to F when F(In1,In2,…InN) = 1 NMOS transistors only pull-down: make a connection from F to GND when F(In1,In2,…InN) = 0 One and only one of the networks (PUN or PDN) is conducting in steady state (output node is always a low-impedance node in steady state) Why PUN of PMOSs only and PDN of NMOSs only ? (Next slide) PUN and PDN are dual logic networks

NMOS Transistors in Series/Parallel Connection Transistors can be thought as a switch controlled by its gate signal NMOS switch closes when switch control input is high

PMOS Transistors in Series/Parallel Connection

Threshold Drops VDD VDD PUN VDD 0  VDD 0  VDD - VTn VGS CL CL PDN Why PMOS in PUN and NMOS in PDN … threshold drop NMOS transistors produce strong zeros; PMOS transistors generate strong ones PDN VDD  0 VDD  |VTp| VGS CL CL D S VDD S D

Complementary CMOS Logic Style

Example Gate: NAND

Example Gate: NOR

Complex CMOS Gate D A B C OUT = D + A • (B + C) Shown synthesis of pull up from pull down structure

Constructing a Complex Gate

Cell Design Standard Cells Datapath Cells General purpose logic Can be synthesized Same height, varying width Datapath Cells For regular, structured designs (arithmetic) Includes some wiring in the cell Fixed height and width

Standard Cell Layout Methodology – 1980s Routing channel VDD signals Contacts and wells not shown. What does this implement?? GND

Standard Cell Layout Methodology – 1990s Mirrored Cell No Routing channels VDD VDD M2 Contacts and wells not shown. What does this implement?? M3 GND Mirrored Cell GND

Standard Cells Cell height 12 metal tracks N Well Cell height 12 metal tracks Metal track is approx. 3 + 3 Pitch = repetitive distance between objects Cell height is “12 pitch” V DD Out In 2 Rails ~10 GND Cell boundary

Standard Cells With minimal diffusion routing With silicided diffusion V DD V DD With silicided diffusion Out In Out In GND GND

Standard Cells 2-input NAND gate V DD A B Out GND

Stick Diagrams Contains no dimensions Represents relative positions of transistors V DD V DD Inverter NAND2 Out Out In A B GND GND

Stick Diagrams Logic Graph j VDD X i GND A B C PUN PDN C A B X = C • (A + B) i j Systematic approach to derive order of input signal wires so gate can be laid out to minimize area Note PUN and PDN are duals (parallel <-> series) Vertices are nodes (signals) of circuit, VDD, X, GND and edges are transitions

Two Versions of C • (A + B) X C A B VDD GND A B C X VDD GND uninterrupted diffusion strip Line of diffusion layout – abutting source-drain connections Note crossover of left layout eliminated by A B C ordering – talk about area needed for via (and speed impact due to via resistance)

Consistent Euler Path An uninterrupted diffusion strip is possible only if there exists a Euler path in the logic graph Euler path: a path through all nodes in the graph such that each edge is visited once and only once. j VDD X i GND A B C A path through all nodes in the graph such that each edge is visited once and only once. The sequence of signals on the path is the signal ordering for the inputs. PUN and PDN Euler paths are (must be) consistent (same sequence) If you can define a Euler path then you can generate a layout with no diffusion breaks A B C C A B B C A  no PDN B A C A C B -> no PDN C B A

OAI22 Logic Graph X PUN A C D C B D VDD X X = (A+B)•(C+D) C D B A A B PDN A GND B C D

Example: x = ab+cd

Multi-Fingered Transistors One finger Two fingers (folded) Less diffusion capacitance

CMOS Circuit Styles Static complementary CMOS - except during switching, output connected to either VDD or GND via a low-resistance path high noise margins full rail to rail swing VOH and VOL are at VDD and GND, respectively low output impedance, high input impedance no steady state path between VDD and GND (no static power consumption) delay a function of load capacitance and transistor resistance comparable rise and fall times Focus on combinational logic – output of the circuit is related to its current input signals by some Boolean expression static CMOS - most widely used logic style

Switch Delay Model Req A B Rp A Rn CL Cint CL B Rn A Rp Cint A A Rp Rn INV Note capacitance on the internal node – due to the source grain of the two fets in series and the overlap gate capacitances of the two fets in series NOR2 NAND2

Input Pattern Effects on Delay Delay is dependent on the pattern of inputs Low to high transition both inputs go low delay is 0.69 Rp/2 CL one input goes low delay is 0.69 Rp CL High to low transition both inputs go high delay is 0.69 2Rn CL A Rp B Rp CL Rn B A Rn Cint

Delay Dependence on Input Patterns Input Data Pattern Delay (psec) A=B=01 67 A=1, B=01 64 A= 01, B=1 61 A=B=10 45 A=1, B=10 80 A= 10, B=1 81 A=B=10 A=1 0, B=1 Voltage [V] A=1, B=10 Gate sizing should result in approximately equal worst case rise and fall times. Reason for difference in the last two delays is due to internal node capacitance of the pulldown stack. When A transitions, the pullup only has to charge CL; when A=1 and B transitions pullup have to charge up both CL and Cint. For high to low transitions (first three cases) delay depends on state of internal node. Worst case happens when internal node is charged up to VDD – VTn. Conclusions: Estimates of delay can be fairly complex – have to consider internal node capacitances and the data patterns. time [ps] NMOS = 0.5m/0.25 m PMOS = 0.75m/0.25 m CL = 100 fF

Transistor Sizing CL B Rn A Rp Cint B Rp A Rn CL Cint 4 2 2 1 Assumes Rp = Rn 1

Transistor Sizing a Complex CMOS Gate B 8 6 4 3 C 8 6 D 4 6 OUT = D + A • (B + C) For class lecture. Red sizing assuming Rp = Rn Follow short path first; note PMOS for C and B 4 rather than 3 – average in pull-up chain of three – (4+4+2)/3 = 3 Also note structure of pull-up and pull-down to minimize diffusion cap at output (e.g., single PMOS drain connected to output) Green for symmetric response and for performance (where Rn = 3 Rp) Sizing rules of thumb PMOS = 3 * NMOS 1 in series = 1 2 in series = 2 3 in series = 3 etc. A 2 D 1 B 2 C 2

Fan-In Considerations B C D CL A Distributed RC model (Elmore delay) tpHL = 0.69 Reqn(C1+2C2+3C3+4CL) Propagation delay deteriorates rapidly as a function of fan-in – quadratically in the worst case. C3 B C2 C While output capacitance makes full swing transition (from VDD to 0), internal nodes only transition from VDD-VTn to GND C1, C2, C3 on the order of 0.85 fF for W/L of 0.5/0.25 NMOS and 0.375/0.25 PMOS CL of 3.2 fF with no output load (all diffusion capacitance – intrinsic capacitance of the gate itself). To give a 80.3 psec tpHL (simulated as 86 psec) C1 D

tp as a Function of Fan-In tpHL quadratic linear tp Gates with a fan-in greater than 4 should be avoided. tp (psec) tpLH Fixed fan-out (NMOS 0.5 micrcon, PMOS 1.5 micron) tpLH increases linearly due to the linearly increasing value of the diffusion capacitance tpHL increase quadratically due to the simultaneous incrase in pull-down resistance and internal capacitance fan-in

tp as a Function of Fan-Out All gates have the same drive current. tpNOR2 tpNAND2 tpINV tp (psec) Slope is a function of “driving strength” slope is a function of the driving strength eff. fan-out

Problems with Complementary CMOS Gate with N inputs requires 2N transistors other circuit styles use N+1 transistors tp deteriorates with high fan-in increases total capacitance series connected transistors slow down gate fan-out loads down gate 1 fan-out = 2 gate capacitors (PMOS and NMOS)