October 2004Computer Hardware Lecture 5 Slide1 / 29 Lecture 5 Physical Realisation of Logic Gates.

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
CT455: Computer Organization Logic gate
Cosc 2150: Computer Organization Chapter 3: Boolean Algebra and Digital Logic.
A Look at Chapter 4: Circuit Characterization and Performance Estimation Knowing the source of delays in CMOS gates and being able to estimate them efficiently.
Fundamentals of Circuits: Direct Current (DC)
Copyright 2001, Agrawal & BushnellDay-1 PM Lecture 4a1 Design for Testability Theory and Practice Lecture 4a: Simulation n What is simulation? n Design.
Lecture 2 Dr Richard Reilly Dept. of Electronic & Electrical Engineering Room 153, Engineering Building To insert your company logo on this slide From.
Lecture #26 Gate delays, MOS logic
Field Effect Transistors Circuit Analysis EE314 HP PA8000 Fujitsu Fairchild Clipper C100.
Sheila Ross and W. G. OldhamEECS 40 Fall 2002 Lecture 2 Copyright Regents of University of California Logic Gates: NOT a Prerequisite! Today: Gates, gates.
Lecture #24 Gates to circuits
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
EE42/100 Lecture 9 Topics: More on First-Order Circuits Water model and potential plot for RC circuits A bit on Second-Order Circuits.
Lecture 3. Boolean Algebra, Logic Gates
Lecture 9, Slide 1EECS40, Fall 2004Prof. White Lecture #9 OUTLINE –Transient response of 1 st -order circuits –Application: modeling of digital logic gate.
9/20/2004EE 42 fall 2004 lecture 91 Lecture #9 Example problems with capacitors Next we will start exploring semiconductor materials (chapter 2). Reading:
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
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.
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.
Chapter 4 Gates and Circuits.
W. G. Oldham EECS 40 Fall 2001 Lecture 5 Copyright Regents of University of California 1 Review of charging and discharging in RC Circuits Lectures 2 and.
MOS Transistors The gate material of Metal Oxide Semiconductor Field Effect Transistors was original made of metal hence the name. Present day devices’
Chapter 4 Gates and Circuits.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
Lecture 17: Digital Design Today’s topic –Intro to Boolean functions Reminders –HW 4 due Wednesday 10/8/2014 (extended) –HW 5 due Wednesday 10/15/2014.
TECH LOGIC CIRCUIT PROJECT BY: JUAN ESTEBAN ARENAS 8: ROOK.
ECE 2300 Circuit Analysis Dr. Dave Shattuck Associate Professor, ECE Dept. Lecture Set #13 Step Response W326-D3.
School of Computer Science G51CSA 1 Computer Systems Architecture Fundamentals Of Digital Logic.
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
1 Boolean Algebra & Logic Gates. 2 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
CSC Intro. to Computing Lecture 5: Boolean Logic, Gates, & Circuits.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
CSCI-100 Introduction to Computing Hardware Design Part I.
LOGIC GATES. Electronic digital circuits are also called logic circuits because with the proper input, they establish logical manipulation paths. Each.
BASIC LOGIC GATES. In studying digital in integrated circuits, one must start with the simples group of circuits, the SSIs or Small Scale Integrated Circuits.
VLSI Design Lecture 5: Logic Gates Mohammad Arjomand CE Department Sharif Univ. of Tech. Adapted with modifications from Wayne Wolf’s lecture notes.
CMOS Logic.  The CMOS Logic uses a combination of p-type and n-type Metal-Oxide-Semiconductor Field Effect Transistors (MOSFETs) to implement logic gates.
Electronic. Analog Vs. Digital Analog –Continuous –Can take on any values in a given range –Very susceptible to noise Digital –Discrete –Can only take.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Digital Logic Design Lecture # 6 University of Tehran.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
EKT 441 MICROWAVE COMMUNICATIONS CHAPTER 3: MICROWAVE NETWORK ANALYSIS (PART 1)
Circuit Analyze  Combinational or Sequential logic schematics show the circuit’s hardware implementation and give us some knowledge about the functions.
Week 4b, Slide 1EECS42, Spring 2005Prof. White Notes 1.Midterm 1 – Thursday February 24 in class. Covers through text Sec. 4.3, topics of HW 4. GSIs will.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Dr. ClincyLecture Slide 1 CS6020- Chapter 3 (3A and ) Dr. Clincy Professor of CS First Exam - Tuesday, September 6th Coverage: All subjects up to.
Logic Gates Unit 16.
Logic gates.
CSIS-110 Introduction to Computer Science
Basics of Logic gates - Part 1
Digital Logic.
Morgan Kaufmann Publishers
Overview Part 1 – Logic Circuits and Boolean Functions
VLSI Testing Lecture 5: Logic Simulation
EKT 356 MICROWAVE COMMUNICATIONS
Vishwani D. Agrawal Department of ECE, Auburn University
Intro to Engineering Electronics
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Intro to Engineering Electronics
Boolean Logic Boolean Logic is considered to be the basic of digital electronics. We know that a computer’s most basic operation is based on digital electronics.
ELECTRONIC SYSTEMS Note: There is no compulsory question set on Section 25 of the syllabus. Questions set on topics within Section 25 are always set as.
Medical electronics II RC operation amplifier circuits
Chapter 4 Gates and Circuits.
Chapter 4 through Section 4.3
Boolean Algebra and Gate Networks
Presentation transcript:

October 2004Computer Hardware Lecture 5 Slide1 / 29 Lecture 5 Physical Realisation of Logic Gates

October 2004Computer Hardware Lecture 5 Slide2 / 29 Boolean Algebra as a Model of Logic Circuits? Boolean Algebra is a good framework for describing the behaviour of logic circuits, but it is not complete. For a practical machine we need to use real voltages, (e.g. ~3.5v for one and ~0.5v for zero), and we need to consider time delays for the signals to propagate through the circuit. Hence Boolean Logic is only an approximation to the way in which a digital circuit operates

October 2004Computer Hardware Lecture 5 Slide3 / 29 Physical Models All physical models are approximate. For example Newtonian mechanics was thought to be exact until about 1900 when more accurate measurements showed that real planetary movements differed from the predicted ones. However, Newtonian mechanics is enormously useful --you don’t need quantum theory to design a car!

October 2004Computer Hardware Lecture 5 Slide4 / 29 Time in Logic Circuits We will see in this lecture that the most important deficiency of Boolean Logic is its inability to describe events happening at different moments in time. Later in the course we will discuss ways in which we can cope with the problems caused by timing.

October 2004Computer Hardware Lecture 5 Slide5 / 29 A more detailled model We can introduce a more detailed model of the operation of logic circuits, and for this we need three components: The Resistor The Capacitor The Transistor

October 2004Computer Hardware Lecture 5 Slide6 / 29 The Resistor This is a familiar device which is governed by Ohm’s Law: V = I R

October 2004Computer Hardware Lecture 5 Slide7 / 29 Procedural vs. Mathematical Models Ohm’s law is a simple mathematical model expressed by an equation. For more complex devices, such as the transistor, it is possible to derive a mathematical equation, but it is much simpler to describe the behaviour of the device. Such a description is called a procedural model

October 2004Computer Hardware Lecture 5 Slide8 / 29 The transistor as a switch The transistor may be thought of a a switch with the three terminals labelled: S : Source D : Drain G : Gate

October 2004Computer Hardware Lecture 5 Slide9 / 29 The rules 1. There is no connection between G and S or G and D 2. If the voltage between G and D (Vgd) is less than 2 volts there is no connection between S and D 3. If the voltage between G and D (Vgd) is greater than 2 volts S is connected directly to D

October 2004Computer Hardware Lecture 5 Slide10 / 29 The Invertor Circuit We can now build an invertor using a resistor and a transistor, but we need to define our Boolean States in terms of voltages: For example: V<1volt is equivalent to Boolean 0 V>3volts is equivalent to Boolean 1

October 2004Computer Hardware Lecture 5 Slide11 / 29 The Invertor Case 1: Vin = 1volt (Boolean 0) The switch is open I = 0 Vr = 0 (Ohm's law) Vout = 5v = Boolean 1

October 2004Computer Hardware Lecture 5 Slide12 / 29 The Invertor Case 2: Vin = 5volt (Boolean 1) The switch is closed Vout = 0 Vr = 5 I = 5/R (Ohm's law)

October 2004Computer Hardware Lecture 5 Slide13 / 29 The nor gate If both switches are open (input A and B both Boolean 0), the output is (5v Boolean 0)

October 2004Computer Hardware Lecture 5 Slide14 / 29 The nor gate If either switch is closed (either, or both, A and B Boolean 1), the output is 0v (Boolean 0)

October 2004Computer Hardware Lecture 5 Slide15 / 29 The nand gate The output falls to 0v (Boolean 0) only when both switches are closed. If either opens it rises to 5v (Boolean 1)

October 2004Computer Hardware Lecture 5 Slide16 / 29 AND and OR gates We can construct an AND gate by connecting a NAND gate and an invertor together. Similarly we can construct an OR gate by connecting a NOR together with an invertor. These models, though simple are surprisingly close to the implementations used in practice.

October 2004Computer Hardware Lecture 5 Slide17 / 29 Using Transistors only: CMOS NMOS+PMOS=CMOS Only uses electrical power to switch!

October 2004Computer Hardware Lecture 5 Slide18 / 29 Time: electrons travelling through our circuit Signal Propagation: it takes time for the transistor state to change.

October 2004Computer Hardware Lecture 5 Slide19 / 29 Goodbye to Boolean Algebra Although the time delay does not seem very important, in practice it complicates logic circuit design. Especially since Boolean Algebra does not incorporate this measure of “time”

October 2004Computer Hardware Lecture 5 Slide20 / 29 The synchronisation problem This example is artificial, but illustrates how a false result (sometimes called a spike) can be caused by time delays.

October 2004Computer Hardware Lecture 5 Slide21 / 29 Problem Break Given that A and B have had their starting values for some time what output would you expect to result from the timing diagram given?

October 2004Computer Hardware Lecture 5 Slide22 / 29 Switch characteristics The transistor is also not a proper switch. For a proper switch: Switch Closed  0 resistance Switch Open   resistance But in practice neither of these extremes are reached

October 2004Computer Hardware Lecture 5 Slide23 / 29 Practical transistor characteristic

October 2004Computer Hardware Lecture 5 Slide24 / 29 Input capacitance Another feature of the real transistor is that it has a small capacitor connected between the gate and the drain. We can represent it schematically thus:

October 2004Computer Hardware Lecture 5 Slide25 / 29 The effect of the capacitor The capacitor has the effect of introducing a time delay. In fact, it is responsible for the time delay td that we talked about previously. To see why we need to introduce a model of the capacitor: I= C (dV/dt)

October 2004Computer Hardware Lecture 5 Slide26 / 29 Calculating the effect of the capacitor Assume A is 0V 5 - V = IR (Ohm's law modelling the resistors behaviour) V = 5 - IR I = C(dV/dt) (The capacitor law) V = 5 - RC (dV/dt) (eliminate I using the capacitor law above)

October 2004Computer Hardware Lecture 5 Slide27 / 29 Calculating the effect of the capacitor Re arrange and integrate  dV/(5-V) =  (1/RC) dt - log (5-V) = t/RC + K If V=0 at t=0 it follows that K = -log(5) 5-V = exp(-t/RC + log(5)) = exp(-t/RC)exp(log(5)) = 5 exp(-t/RC) V = 5( 1- exp(-t/RC))

October 2004Computer Hardware Lecture 5 Slide28 / 29 Plotting the effect of the capacitor From the previous slide: V = 5( 1- exp(-t/RC))

October 2004Computer Hardware Lecture 5 Slide29 / 29 Practical representation of a square wave Notice that the voltage will never reach 1 or 0 There is a non-deterministic time interval which limits the speed that the computer can go