Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Slides to accompany the textbook Digital Design, First Edition, by Frank Vahid, John Wiley.

Slides:



Advertisements
Similar presentations
Chapter 4 Gates and Circuits.
Advertisements

CT455: Computer Organization Logic gate
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter 4 Gates and Circuits.
Logical Design.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Chapter 2: Combinational Logic Design Slides to accompany the textbook Digital Design, First.
Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Chapter 2: Combinational Logic Design Slides to accompany the textbook Digital Design, First.
Chapter 4 Gates and Circuits.
9/19/06 Hofstra University – Overview of Computer Science, CSC005 1 Chapter 4 Gates and Circuits.
Faculty of Computer Science © 2006 CMPUT 229 Digital Logic From Switches to Memories.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 4 Technology.
Combinational Logic Design Process
Lecture 3. Boolean Algebra, Logic Gates
Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Chapter 2: Combinational Logic Design Slides to accompany the textbook Digital Design, First.
Prof. Kavita Bala and Prof. Hakim Weatherspoon CS 3410, Spring 2014 Computer Science Cornell University See: P&H Appendix B.2 and B.3 (Also, see B.0 and.
Lecture 8 Topics –Switch –Transistor –CMOS transistor –Logic gates AND, OR, NOT Universal gates: NAND, NOR XOR.
Gates and Logic: From switches to Transistors, Logic Gates and Logic Circuits Hakim Weatherspoon CS 3410, Spring 2013 Computer Science Cornell University.
Digital Design - Combinational Logic Design Chapter 2 - Combinational Logic Design.
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.
Chapter 2: Combinational Logic Design
Chapter 4 Gates and Circuits.
Lecture 3. Error Detection and Correction, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
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.
Chapter 4 Gates and Circuits.
1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Elementary Digital Logic Apps O/S Arch  Arch Logic Digital Analog.
Transistors and Logic Circuits. Transistor control voltage in voltage out control high allows current to flow -- switch is closed (on) control low stops.
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.
Logic Design A Review. Binary numbers Binary numbers to decimal  Binary 2 decimal  Decimal 2 binary.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
SUPLEMENTARY CHAPTER 1: An Introduction to Digital Logic The Architecture of Computer Hardware and Systems Software: An Information Technology Approach.
Introduction to Computing Systems from bits & gates to C & beyond Chapter 3 Digital Logic Structures Transistors Logic gates & Boolean logic Combinational.
Boolean Algebra and Digital Circuits
CPS120: Introduction to Computer Science
1 The Chinese University of Hong Kong Faculty of Education Diploma in Education (Part-Time) Winter 1997 Educational Communications and Technology Assignment.
Verilog HDL. Hardware Description Language  HDL – a “language” for describing hardware  Two industry IEEE standards: Verilog VHDL (Very High Speed Integrated.
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.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Chapter 2: Combinational Logic Design Slides to accompany the textbook Digital Design, First.
IT253: Computer Organization Lecture 7: Logic and Gates: Digital Design Tonga Institute of Higher Education.
1 Lecture 12 More about Combinational Analysis and Design Procedures.
Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.
Boolean Algebra Computer Architecture. Digital Representation Digital is an abstraction of analog voltage –Voltage is a continuous, physical unit Typically.
Digital Computers Logic Gates & Applications. Digital Computers Types of Material (Electric Conductivity) – Insulator Rubber / wood – Conductor Copper.
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.
Digital electronics 4–1 Gates and Circuits SANJAYBHAI RAJGURU COLLEGE OF ENGG.
Minute Paper 4/4/04 Z=50+j86.7=100
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
L OGIC G ATES Computer Organization – week 3. W HAT ’ S ALU? 1. ALU stands for: Arithmetic Logic Unit 2. ALU is a digital circuit that performs Arithmetic.
Week 1: Introduction and Logic gates IT3002 – Computer Architecture
Computer Architecture & Operations I
CSIS-110 Introduction to Computer Science
Digital Logic.
Morgan Kaufmann Publishers
Transistors and Logic Circuits
Overview Part 1 – Gate Circuits and Boolean Equations
Chapter 4 Gates and Circuits.
CS140 Lecture 02a: The Machinery of Computation: Circuits and Gates
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Computer Science 210 Computer Organization
Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan
Schematics 201 Lecture Topic: Electrical Symbols
Combinatorial Logic Circuit
Lecture 4 – Binary Logic and Logic Gates
Presentation transcript:

Digital Design Copyright © 2006 Frank Vahid 1 Digital Design Slides to accompany the textbook Digital Design, First Edition, by Frank Vahid, John Wiley and Sons Publishers, Copyright © 2007 Frank Vahid Instructors of courses requiring Vahid's Digital Design textbook (published by John Wiley and Sons) have permission to modify and use these slides for customary course-related activities, subject to keeping this copyright notice in place and unmodified. These slides may be posted as unanimated pdf versions on publicly-accessible course websites.. PowerPoint source (or pdf with animations) may not be posted to publicly-accessible websites, but may be posted for students on internal protected sites or distributed directly to students by other electronic means. Instructors may make printouts of the slides available to students for a reasonable photocopying charge, without incurring royalties. Any other use requires explicit permission. Instructors may obtain PowerPoint source or obtain special use permissions from Wiley – see for information.

Digital Design Copyright © 2006 Frank Vahid 2 Switches Electronic switches are the basis of binary digital circuits –Electrical terminology Voltage: Difference in electric potential between two points –Analogous to water pressure Current: Flow of charged particles –Analogous to water flow Resistance: Tendency of wire to resist current flow –Analogous to water pipe diameter V = I * R (Ohm’s Law) 4.5 A 2 ohms 9V 0V 9V +– 2.2

Digital Design Copyright © 2006 Frank Vahid 3 Switches A switch has three parts –Source input, and output Current wants to flow from source input to output –Control input Voltage that controls whether that current can flow “off” “on” outputsource input outputsource input control input control input (b) relay vacuum tube discrete transistor IC quarter (to see the relative size) a

Digital Design Copyright © 2006 Frank Vahid 4 The CMOS Transistor CMOS transistor –Basic switch in modern ICs does not conduct 0 conducts 1 gate nMOS does not conduct 1 gate pMOS conducts 0 Silicon -- not quite a conductor or insulator: Semiconductor 2.3 a

Digital Design Copyright © 2006 Frank Vahid 5 Logic Design Combinational Circuits –Output is function of inputs only –Design using logic gates as building block or truth table –Logic optimization Sequential Circuits –Using combinational circuits in conjunction with memory elements (Circuits that operate one cycle at a time) –Design Using Finite State Machine and state encoding followed by combinational circuit design –Optimization such as state minimization, state encoding, etc. Objectives –Delay, area, power, cost, etc.

Digital Design Copyright © 2006 Frank Vahid 6 Boolean Logic Gates Building Blocks for Digital Circuits (Because Switches are Hard to Work With) “Logic gates” are better digital circuit building blocks than switches (transistors) –Why?

Digital Design Copyright © 2006 Frank Vahid 7 Relating Boolean Algebra to Digital Design Implement Boolean operators using transistors –Call those implementations logic gates. x y F x y F x 0 1 F 1 0 F x x y F ORNOT F x y AND 0 1 y x x y F 1 0 F x Symbol Truth table Transistor circuit 0 1 x y F y x

Digital Design Copyright © 2006 Frank Vahid 8 NOT/OR/AND Logic Gate Timing Diagrams time F x 1 0 x y F

Digital Design Copyright © 2006 Frank Vahid 9 Some Circuit Drawing Conventions

Digital Design Copyright © 2006 Frank Vahid 10 Representations of Boolean Functions A function can be represented in different ways –Above shows seven representations of the same functions F(a,b), using four different methods: English, Equation, Circuit, and Truth Table 2.6 a a b F F Circuit 1 Circuit 2 (c) (d) English 1: F outputs 1 when a is 0 and b is 0, or when a is 0 and b is 1. English 2: F outputs 1 when a is 0, regardless of b’s value (a) (b) a b F The function F Truth table Equation 2: F(a,b) = a’ Equation 1: F(a,b) = a’b’ + a’b

Digital Design Copyright © 2006 Frank Vahid 11 Truth Table Representation of Boolean Functions Define value of F for each possible combination of input values –2-input function: 4 rows –3-input function: 8 rows –4-input function: 16 rows Q: Use truth table to define function F(a,b,c) that is 1 when abc is 5 or greater in binary c d a b Fc a b Fa b F (a) (b) (c) c a b F a

Digital Design Copyright © 2006 Frank Vahid 12 Combinational Logic Design Process StepDescription Step 1 Capture the function Create a truth table or equations, whichever is most natural for the given problem, to describe the desired behavior of the combinational logic. Step 2 Convert to equations This step is only necessary if you captured the function using a truth table instead of equations. Create an equation for each output by ORing all the minterms for that output. Simplify the equations if desired. Step 3 Implement as a gate- based circuit For each output, create a circuit corresponding to the output’s equation. (Sharing gates among multiple outputs is OK optionally.) 2.7

Digital Design Copyright © 2006 Frank Vahid 13 More Gates NAND: Opposite of AND (“NOT AND”) NOR: Opposite of OR (“NOT OR”) XOR: Exactly 1 input is 1, for 2-input XOR. (For more inputs -- odd number of 1s) XNOR: Opposite of XOR (“NOT XOR”) 2.8 x y F x y F x y F x y F x y x y FF NORNANDXORXNOR 1 0 x y F x y 1 0 x x y y F NANDNOR NAND same as AND with power & ground switched Why? nMOS conducts 0s well, but not 1s (reasons beyond our scope) -- so NAND more efficient Likewise, NOR same as OR with power/ground switched AND in CMOS: NAND with NOT OR in CMOS: NOR with NOT So NAND/NOR more common

Digital Design Copyright © 2006 Frank Vahid 14 More Gates: Example Uses Aircraft lavatory sign example –S = (abc)’ Detecting all 0s –Use NOR Detecting equality –Use XNOR Detecting odd # of 1s –Use XOR –Useful for generating “parity” bit common for detecting errors S Circuit a b c a0 b0 a1 b1 a2 b2 A=B

Digital Design Copyright © 2006 Frank Vahid 15 Completeness of NAND Any Boolean function can be implemented using just NAND gates. Why? –Need AND, OR, and NOT –NOT: 1-input NAND (or 2-input NAND with inputs tied together) –AND: NAND followed by NOT –OR: NAND preceded by NOTs Likewise for NOR

Digital Design Copyright © 2006 Frank Vahid 16 Additional Considerations Schematic Capture and Simulation Schematic capture –Computer tool for user to capture logic circuit graphically Simulator –Computer tool to show what circuit outputs would be for given inputs Outputs commonly displayed as waveform 2.10 Simulate d3 d2 d1 d0 i0 i1 Outputs Inputs d3 d2 d1 d0 i0 i1 Outputs Inputs

Digital Design Copyright © 2006 Frank Vahid 17 Additional Considerations Non-Ideal Gate Behavior -- Delay Real gates have some delay –Outputs don’t change immediately after inputs change