Computer Organization and Design Transistors and all that… a brief overview Montek Singh Mar 21, 2016 Lecture 9 1.

Slides:



Advertisements
Similar presentations
CSET 4650 Field Programmable Logic Devices
Advertisements

COMP541 Transistors and all that… a brief overview
ECE C03 Lecture 41 Lecture 4 Combinational Logic Implementation Technologies Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.
Lecture #26 Gate delays, MOS logic
EE 4271 VLSI Design, Fall 2011 CMOS Combinational Gate.
L08 – Transistors and Logic 1 Comp 411 – Fall /30/09 Transistors and Logic A B Comp 411 Box-o-Tricks F = A xor B 1) The digital contract 2) Encoding.
11/5/2004EE 42 fall 2004 lecture 281 Lecture #28 PMOS LAST TIME: NMOS Electrical Model – NMOS physical structure: W and L and d ox, TODAY: PMOS –Physical.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #4
Chapter 4 Gates and Circuits.
Computer Engineering 222. VLSI Digital System Design Introduction.
Lecture 21 Today we will Revisit the CMOS inverter, concentrating on logic 0 and logic 1 inputs Come up with an easy model for MOS transistors involved.
Lecture #24 Gates to circuits
Faculty of Computer Science © 2006 CMPUT 229 Digital Logic From Switches to Memories.
Computer ArchitectureFall 2008 © August 20 th, Introduction to Computer Architecture Lecture 2 – Digital Logic Design.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 5 Dr. Shi Dept. of Electrical and Computer Engineering.
10-7 Metal-Oxide Semiconductor ( MOS )  Field-Effect Transistor ( FET ) Unipolar transistor Depend on the flow of only one type of carrier JFET, MOS 
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:
Lecture 0: Introduction. CMOS VLSI Design 4th Ed. 0: Introduction2 Introduction  Integrated circuits: many transistors on one chip.  Very Large Scale.
Lecture 2. Logic Gates Prof. Taeweon Suh Computer Science Education Korea University ECM585 Special Topics in Computer Design.
Lecture 8 Topics –Switch –Transistor –CMOS transistor –Logic gates AND, OR, NOT Universal gates: NAND, NOR XOR.
CSET 4650 Field Programmable Logic Devices
ECE 331 – Digital System Design Transistor Technologies, and Realizing Logic Gates using CMOS Circuits (Lecture #23)
Chapter 4 Gates and Circuits. 4–2 Chapter Goals Identify the basic gates and describe the behavior of each Describe how gates are implemented using transistors.
Chapter 4 Gates and Circuits.
CS231: Computer Architecture I Laxmikant Kale Fall 2004.
Electronic Troubleshooting Chapter 10 Digital Circuits.
EE 5900 Advanced Algorithms for Robust VLSI CAD, Spring 2009
MOS Transistors The gate material of Metal Oxide Semiconductor Field Effect Transistors was original made of metal hence the name. Present day devices’
Chapter 3 Digital Logic Structures. 3-2 Transistor: Building Block of Computers Microprocessors contain millions of transistors Intel Pentium 4 (2000):
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
We know binary We know how to add and subtract in binary –Same as in decimal Next up: learn how apply this knowledge Boolean and Binary Inputs.
1 Integrated Circuits Basics Titov Alexander 25 October 2014.
Lecture 2. Logic Gates Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
Digital Logic. 4 Why is 32-bit or 64-bit significant in terms of speed, efficiency? 4 Difference between OR and XOR 4 What is a mux for? PLA 4 Two kinds.
EE4800 CMOS Digital IC Design & Analysis
Chapter 1 Combinational CMOS Logic Circuits Lecture # 4 Pass Transistors and Transmission Gates.
ECE2030 Introduction to Computer Engineering Lecture 4: CMOS Network Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering Georgia Tech.
EE210 Digital Electronics Class Lecture 9 April 08, 2009.
Computer Organization and Design Transistors and all that… a brief overview Montek Singh Oct 12, 2015 Lecture 9 1.
Lecture 8 Transistors Topics Review: Combinational Circuits Decoders Multiplexers Breadboards, LEDs Components on integrated circuit (ICs) Transistors.
 Seattle Pacific University EE Logic System DesignNMOS-CMOS-1 Voltage-controlled Switches In order to build circuits that implement logic, we need.
1. Digital cmos.2 10/15 Figure 10.1 Digital IC technologies and logic-circuit families. Digital IC Technologies CMOS & Pass Transistor Logic dominate.
Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP
Computer Organization and Design Transistors & Logic - I Montek Singh Wed, Oct 10, 2012 Lecture 10 1.
1 COMP541 Combinational Logic - 3 Montek Singh Jan 23, 2012.
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]
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Announcements Assignment 6 due tomorrow No Assignment 7 yet.
1 COMP541 Combinational Logic - 3 Montek Singh Jan 21, 2015.
Solid-State Devices & Circuits
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.
Introduction to CMOS Transistor and Transistor Fundamental
Computer Organization and Design Transistors & Logic - I Montek Singh Mon, Feb 28, 2011 Lecture 8.
1 ECE2030 Introduction to Computer Engineering Lecture 4: CMOS Network Prof. Hsien-Hsin Sean Lee School of ECE Georgia Institute of Technology.
Computer Organization and Design Transistors & Logic - II Montek Singh Mon, Mar 14, 2011 Lecture 9.
Computer Organization and Design Transistors & Logic - I Montek Singh Wed, Oct 14, 2013 Lecture 9 1.
Lecture 2. Logic Gates Prof. Taeweon Suh Computer Science & Engineering Korea University COSE221, COMP211 Logic Design.
Computer Organization and Design Transistors & Logic - II Montek Singh Wed, Oct 17, 2012 Lecture 11.
Introduction to CMOS VLSI Design Lecture 0: Introduction.
COMP541 Transistors and all that… a brief overview
COMP541 Combinational Logic - 3
Transistors and Logic - II
COMP541 Transistors and all that… a brief overview
COMP541 Combinational Logic - 3
Montek Singh Oct 25, 2017 Lecture 9
Transistors and Logic A B The digital contract
COMP541 Combinational Logic - 3
COMP541 Transistors and all that… a brief overview
Transistors and Logic A B The digital contract
Presentation transcript:

Computer Organization and Design Transistors and all that… a brief overview Montek Singh Mar 21, 2016 Lecture 9 1

Today’s Topics  Where are we in this course?  Today’s topics Why go digital? Why go digital? Encoding bits using voltages Encoding bits using voltages Digital design primitives Digital design primitives  transistors and gates 2

Let’s go digital!  Why DIGITAL? … because it helps guarantee a reliable system … because it helps guarantee a reliable system  The price we pay for this robustness? All the information that we transfer between components is only 1 crummy bit! All the information that we transfer between components is only 1 crummy bit! But, in exchange, we get a guarantee of a reliable system. But, in exchange, we get a guarantee of a reliable system. 0 or 1 3

The Digital Abstraction Real World “Ideal” Abstract World Volts or Electrons or Ergs or Gallons Bits 0/1 Keep in mind, the world is not digital, we engineer it to behave so. We must use real physical phenomena to implement digital designs! Noise Manufacturing Variations 4

Types of Digital Components  Two categories of components those whose output only depends on their current inputs those whose output only depends on their current inputs  called COMBINATIONAL  they are “memory-less”, don’t remember the past those who output depends also on their past state those who output depends also on their past state  called SEQUENTIAL  they are “state-holding”, remember their past  key to building memories 5

Terminology  System a reasonably large assembly of components a reasonably large assembly of components division of a system into components is typically arbitrary but almost always hierarchical division of a system into components is typically arbitrary but almost always hierarchical  Component/Element an individual part of a bigger system an individual part of a bigger system clearly-defined function and interface clearly-defined function and interface implement it and put a black-box around it implement it and put a black-box around it larger components created using smaller components larger components created using smaller components  Circuit a small (often leaf-level) component consisting of a network of gates a small (often leaf-level) component consisting of a network of gates 6

Combinational Components  A circuit is combinational if-and-only-if it has: one or more digital inputs one or more digital inputs one or more digital outputs one or more digital outputs a functional specification that details the value of each output for every possible combination of valid input values a functional specification that details the value of each output for every possible combination of valid input values  output depends only on the latest inputs a timing specification consisting (at minimum) of an upper bound t pd on the time this circuit will take to produce the output value once stable valid input values are applied a timing specification consisting (at minimum) of an upper bound t pd on the time this circuit will take to produce the output value once stable valid input values are applied Output a “1” if at least 2 out of 3 of my inputs are a “1”. Otherwise, output “0”. I will generate a valid output in no more than 2 minutes after seeing valid inputs input A input B input C output Y 7

A Combinational Digital System  Theorem: A system of interconnected elements is combinational if-and-only-if: each primitive circuit element is combinational each primitive circuit element is combinational every input is connected to exactly one output or directly to a source of 0’s or 1’s every input is connected to exactly one output or directly to a source of 0’s or 1’s the circuit contains no directed cycles the circuit contains no directed cycles  no feedback (yet!)  Proof: By induction Start with the rightmost level of elements Start with the rightmost level of elements  their output only depends on their inputs, which in turn are outputs of the level of element just to their left  and so on… until you arrive at the leftmost inputs  But, in order to realize digital processing elements we have one more requirement! 8

Noise Margins  Key idea: Keep “0”s distinct from the “1”s say, “0” is represented by min voltage (e.g., 0 volts) say, “0” is represented by min voltage (e.g., 0 volts) … “1” is represented by high voltage (e.g., 1.8 volts) … “1” is represented by high voltage (e.g., 1.8 volts) use the same voltage representation throughout the entire system! use the same voltage representation throughout the entire system!  For reliability, outlaw “close calls” forbid a range of voltages between “0” and “1” forbid a range of voltages between “0” and “1” volts Forbidden Zone Valid “0” Valid “1” Invalid CONSEQUENCE: Notion of “VALID” and “INVALID” logic levels Min Voltage Max Voltage 9

AND Digital Processing Elements  Some digital processing elements occur so frequently that we give them special names and symbols AY I will only output a ‘1’ if all my inputs are ‘1’ A B Y OR I will output a ‘1’ if any of my inputs are ‘1’ A B Y AY A B Y XOR I will only output a ‘1’ if an odd number of my inputs are ‘1’ buffer inverter I will output the complement of my input I will copy and restore my input to my output 10

AND Digital Processing Elements  Some digital processing elements occur so frequently that we give them special names and symbols AY A B Y OR A B Y AY A B Y XOR buffer inverter 11

Most common technology today  … is called CMOS everything built using transistors everything built using transistors a transistor is just a switch a transistor is just a switch  2 types of transistors n-type n-type  called “NFET”, or “nMOS” or “n channel transistor” or “n transistor”  switch is on (i.e., conducts) when its control input is ‘1’ p-type p-type  called “PFET”, or “pMOS”, or “p channel transistor” or “p transistor”  switch is on (i.e., conducts) when its control input is ‘0’ need both types to build useful gates need both types to build useful gates 12

Transistors as switches  At an abstract level, transistors are merely switches 3-ported voltage-controlled switch 3-ported voltage-controlled switch  n-type: conduct when control input is 1  p-type: conduct when control input is 0 13

Silicon as a semiconductor  Transistors are built from silicon  Pure Si itself does not conduct well  Impurities are added to make it conducting As provides free electrons  n-type As provides free electrons  n-type B provides free “holes”  p-type B provides free “holes”  p-type Silicon lattice and dopant atoms (from Harris and Harris)

MOS Transistors  MOS = Metal-oxide semiconductor  3 terminals gate: the voltage here controls whether current flows gate: the voltage here controls whether current flows source and drain: are what the current flows between source and drain: are what the current flows between  structurally, source and drain are the same nMOS and pMOS transistors (from Harris and Harris)

nMOS Transistors  Gate = 0 OFF = disconnect OFF = disconnect  no current flows between source & drain  Gate = 1 ON= connect ON= connect  current can flow between source & drain  positive gate voltage draws in electrons to form a channel nMOS transistor operation (from Harris and Harris)

pMOS Transistors  Just the opposite Gate = 1  disconnect Gate = 1  disconnect Gate = 0  connect Gate = 0  connect 17

Summary: nMOS and pMOS Transistors  Summary: 18

CMOS Topologies  There is actually more to it than connect/disconnect nMOS: pass good 0’s, but bad 1’s nMOS: pass good 0’s, but bad 1’s  so connect source to GND pMOS: pass good 1’s, but bad 0’s pMOS: pass good 1’s, but bad 0’s  so connect source to V DD  Typically use them in complementary fashion: nMOS network at bottom nMOS network at bottom  pulls output value down to 0 pMOS network at top pMOS network at top  pulls output value up to 1 only one of the two networks must conduct at a time! only one of the two networks must conduct at a time!  or smoke may be produced if neither network conducts  output will be floating if neither network conducts  output will be floating 19

From Transistors… to Gates!  Logic Gate recipe: use complementary arrangements of PFETs and NFETs use complementary arrangements of PFETs and NFETs  called CMOS (“complementary metal-oxide semiconductor”) at any time: either “pullup” active, or “pulldown”, never both! at any time: either “pullup” active, or “pulldown”, never both! V DD V IN V OUT pullup: make this connection when V IN is near 0 so that V OUT = V DD pulldown: make this connection when V IN is near V DD so that V OUT = 0 We’ll use p-type here and, n-type here Gnd

CMOS Inverter V in V out V in V out AY inverter Only a narrow range of input voltages result in “invalid” output values. (This diagram is greatly exaggerated) Valid “1” Valid “0” Invalid “1”“1”“0”“0” “0”“0”“1”“1”

CMOS Complements conducts when A is highconducts when A is low conducts when A is high and B is high: A. B A B AB conducts when A is low or B is low: A+B = A. B conducts when A is high or B is high: A+B A B AB conducts when A is low and B is low: A. B = A+B AA Series N connections: Parallel N connections: Parallel P connections: Series P connections:

A Two Input Logic Gate A B What function does this gate compute? A B Y (see next slide) Y

NAND 24 ABP1P2N1N2Y 00ON OFF 1 01ONOFF ON1 10OFFON OFF1 11 ON 0

Here’s Another… What function does this gate compute? A B C A B 2-input NOR gate

3-input NOR Gate? 26

Drawing Style  Indicate inputs and outputs using arrows or: inputs at left/top, outputs at right/bottom or: inputs at left/top, outputs at right/bottom  If possible, gates should flow from left to right or: top to bottom or: top to bottom  Straight wires best or: keep bends at a minimum (preferably 90 deg) or: keep bends at a minimum (preferably 90 deg)  Connections: wires always connect at a “T” junction wires always connect at a “T” junction a dot at a wire crossing indicates connection a dot at a wire crossing indicates connection wire crossing without a dot means no connection wire crossing without a dot means no connection 27

Circuit Schematic Rules (cont.) Wire connections A dot where wires cross indicates a connection A dot where wires cross indicates a connection Wires crossing without a dot make no connection Wires crossing without a dot make no connection Wires always connect at a T junction Wires always connect at a T junction 28

CMOS Gates Like to Invert Observation: CMOS gates tend to be inverting! One or more “0” inputs are necessary to generate a “1” output One or more “0” inputs are necessary to generate a “1” output One or more “1” inputs are necessary to generate a “0” output One or more “1” inputs are necessary to generate a “0” output Why? Why? A B

General CMOS Gate Recipe Step 1. Figure out pulldown network that does what you want (i.e the set of conditions where the output is ‘0’) e.g., F = A*(B+C) A BC Step 2. Walk the hierarchy replacing nfets with pfets, series subnets with parallel subnets, and parallel subnets with series subnets A B C Step 3. Combine pfet pullup network from Step 2 with nfet pulldown network from Step 1 to form fully- complementary CMOS gate. A B C A BC

One More Exercise  Lets construct a gate to compute: F = A+BC = NOT(OR(A,AND(B,C))) F = A+BC = NOT(OR(A,AND(B,C))) Step 1: Draw the pull-down network Step 1: Draw the pull-down network Step 2: The complementary pull-up network Step 2: The complementary pull-up network F A B C V dd A BC

One More Exercise  Lets construct a gate to compute: F = A+BC = NOT(OR(A,AND(B,C))) F = A+BC = NOT(OR(A,AND(B,C))) Step 1: Draw the pull-down network Step 1: Draw the pull-down network Step 2: The complementary pull-up network Step 2: The complementary pull-up network Step 3: Combine and Verify Step 3: Combine and Verify F A B C V dd A B C ABCF