Lecture 4: Implementation AND, OR, NOT Gates and Complement

Similar documents
CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

BOOLEAN ALGEBRA & LOGIC GATES

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

Boolean Algebra Part 1

CH3 Boolean Algebra (cont d)

Unit 3 Boolean Algebra (Continued)

Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

CSE140: Midterm 1 Solution and Rubric

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

Simplifying Logic Circuits with Karnaugh Maps

Logic Reference Guide

Gates, Circuits, and Boolean Algebra

CSE140: Components and Design Techniques for Digital Systems

Basic Logic Gates Richard E. Haskell

Combinational circuits

CHAPTER 3 Boolean Algebra and Digital Logic

Logic in Computer Science: Logic Gates

Switching Algebra and Logic Gates

A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc

Two-level logic using NAND gates

ELEC EXPERIMENT 1 Basic Digital Logic Circuits

Chapter 2 Logic Gates and Introduction to Computer Architecture

Digital Logic Design

DESIGN OF GATE NETWORKS

2.0 Chapter Overview. 2.1 Boolean Algebra

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

Analog & Digital Electronics Course No: PH-218

Lecture 5: Gate Logic Logic Optimization

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

Digital Electronics Detailed Outline

Click on the links below to jump directly to the relevant section

Elementary Logic Gates

ENGI 241 Experiment 5 Basic Logic Gates

3.Basic Gate Combinations

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Understanding Logic Design

Section 1. Finding Common Terms

Chapter 7 Memory and Programmable Logic

Class One: Degree Sequences

Read-only memory Implementing logic with ROM Programmable logic devices Implementing logic with PLDs Static hazards

1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, Lab 2. The Full-Adder

2 : two cube. 5 : five cube. 10 : ten cube.

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

Gates & Boolean Algebra. Boolean Operators. Combinational Logic. Introduction

Having read this workbook you should be able to: recognise the arrangement of NAND gates used to form an S-R flip-flop.

Combinational Logic Design

Testing & Verification of Digital Circuits ECE/CS 5745/6745. Hardware Verification using Symbolic Computation

Decimal Number (base 10) Binary Number (base 2)

C H A P T E R. Logic Circuits

A Course Material on DIGITAL PRINCIPLES AND SYSTEM DESIGN

Negative Integer Exponents

ANALOG & DIGITAL ELECTRONICS

SECTION C [short essay] [Not to exceed 120 words, Answer any SIX questions. Each question carries FOUR marks] 6 x 4=24 marks

Computer Engineering 290. Digital Design: I. Lecture Notes Summer 2002

Sect Greatest Common Factor and Factoring by Grouping

FORDHAM UNIVERSITY CISC Dept. of Computer and Info. Science Spring, The Binary Adder

Scilab Textbook Companion for Digital Electronics: An Introduction To Theory And Practice by W. H. Gothmann 1

Philadelphia University Faculty of Information Technology Department of Computer Science Semester, 2007/2008.

Combinational Logic Design Process

Karnaugh Maps (K-map) Alternate representation of a truth table

SOLUTIONS MANUAL DIGITAL DESIGN FOURTH EDITION M. MORRIS MANO California State University, Los Angeles MICHAEL D.

Binary Adders: Half Adders and Full Adders

MATHEMATICS FOR ENGINEERING BASIC ALGEBRA

1.3 Polynomials and Factoring

Gates. J. Robert Jump Department of Electrical And Computer Engineering Rice University Houston, TX 77251

Chapter 1. Computation theory

Sum-of-Products and Product-of-Sums expressions

Operations with Algebraic Expressions: Multiplication of Polynomials

Digital Logic Elements, Clock, and Memory Elements

CHAPTER 8, GEOMETRY. 4. A circular cylinder has a circumference of 33 in. Use 22 as the approximate value of π and find the radius of this cylinder.

Algebraic Properties and Proofs

Take-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas

COMPUTER SCIENCE. Paper 1 (THEORY)

6. BOOLEAN LOGIC DESIGN

How To Prove The Triangle Angle Of A Triangle

Relational Database Design

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

Factoring Polynomials: Factoring by Grouping

Design and Development of Virtual Instrument (VI) Modules for an Introductory Digital Logic Course

Lecture 5 Principal Minors and the Hessian

Warm-up Tangent circles Angles inside circles Power of a point. Geometry. Circles. Misha Lavrov. ARML Practice 12/08/2013

Course Requirements & Evaluation Methods

RUTGERS UNIVERSITY Department of Electrical and Computer Engineering 14:332:233 DIGITAL LOGIC DESIGN LABORATORY

Interfacing Analog to Digital Data Converters

Binary full adder. 2-bit ripple-carry adder. CSE 370 Spring 2006 Introduction to Digital Design Lecture 12: Adders

exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576

BEGINNING ALGEBRA ACKNOWLEDMENTS

Counters and Decoders

EE360: Digital Design I Course Syllabus

Lecture 12: More on Registers, Multiplexers, Decoders, Comparators and Wot- Nots

Upon completion of unit 1.1, students will be able to

NEW adder cells are useful for designing larger circuits despite increase in transistor count by four per cell.

Transcription:

EE210: Switching Systems Lecture 4: Implementation AND, OR, NOT Gates and Complement Prof. YingLi Tian Sept. 14, 2016 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) 1

Outlines Quick Review of the Last Lecture AND, OR, NOT Gates Switching Algebra Properties of Switching Algebra Definitions of Algebraic Functions Implementation AND, OR, NOT Gates Complement (NOT) Truth table to algebraic expressions 2

3 Gate Implementation P2b: a(bc) = (ab) c P2a: a + (b + c) = (a + b) + c Who want to implement it?

Definition of Switching Algebra OR -- a + b (read a OR b) AND -- a b = ab (read a AND b) NOT -- a (read NOT a) 4

5 Gate Implementation P2b: a(bc) = (ab) c These three implementations are equal. P2a: a + (b + c) = (a + b) + c Need a volunteer to implement it.

Manipulation of Algebraic Functions -- 1 A literal is the appearance of a variable or its complement. ab + bc d + a d + e ---- 8 literals. A product term is one or more literals connected by AND operators. ab + bc d + a d + e ---- 4 product terms (ab, bc d, a d, and e ). A standard product term, also minterm is a product term that includes each variable of the problem, either uncomplemented or complemented. a function of 4 variables, w, x, y, and z, the terms wxyz and w xyz are standard product term.

Manipulation of Algebraic Functions -- 2 A sum of products expression (often abbreviated SOP) is one or more product terms connected by OR operators. ab + bc d + a d + e A canonical sum or sum of standard product terms is just a sum of products expression where all of the terms are standard product terms. x yz + x yz + xy z + xy z + xyz ---- 5 terms, 15 literals

Manipulation of Algebraic Functions -- 3 A minimum sum of products expression is one of those SOP expressions for a function that has the fewest number of product terms. If there is more than one expression with the fewest number of terms, then minimum is defined as one or more of those expressions with the fewest number of literals. (1) x yz + x yz + xy z + xy z + xyz 5 terms, 15 literals (2) x y + xy + xyz 3 terms, 7 literals (3) x y + xy + xz 3 terms, 6 literals (4) x y + xy + yz 3 terms, 6 literals They all are equal. (3) And (4) are minimum sum of products. See page 44 for details.

Manipulation of Algebraic Functions -- 4 A sum term is one or more literals connected by OR operators. A standard sum term, also called a maxterm, is a sum term that includes each variable of the problem, either uncomplemented or complemented. A product of sums expression (POS) is one or more sum terms connected by AND operators. A canonical product or product of standard sum terms is just a product of sums expression where all of the terms are standard sum terms. SOP: x y + xy + xyz POS: (x + y )(x + y)(x + z ) Both: x + y + z or xyz Neither: x(w + yz) or z + wx y + v(xz + w )

SOP and POS A sum of products expression (often abbreviated SOP) is one or more product terms connected by OR operators. ab + bc d + a d + e ----?? terms,?? literals A product of sums expression (POS) is one or more sum terms connected by AND operators. SOP: x y + xy + xyz POS: (x + y )(x + y)(x + z ) A literal is the appearance of a variable or its complement. A term is one or more literals connected by AND, OR, operators.

Implementation of functions with AND, OR, NOT Gates -- 1 Given function: f= x yz + x yz + xy z + xy z + xyz Two-level circuit (maximum number of gates which a signal must pass from the input to the output) 11

Implementation of functions with AND, OR, NOT Gates -- 2 (1) x yz + x yz + xy z + xy z + xyz (2) x y + xy + xyz (3) x y + xy + xz (4) x y + xy + yz

Implementation of functions with AND, OR, NOT Gates -- 3 Function: x y + xy + xz, when only use uncomplemented inputs:

14 Multi-level circuit Function? (see Page50)

Commonly used terms DIPs dual in-line pin packages (chips) ICs integrated circuits SSI small-scale integration (a few gates) MSI medium-scale integration (~ 100 gates) LSI -- large-scale integration VLSI very large-scale integration GSI giga-scale integration 15

Examples Need a 3-input OR (or AND), and only 2- input gates are available Need a 2-input OR (or AND), and only 3- input gates are available 16

Positive and Negative Logic Use 2 voltages to represent logic 0 and 1 For example: Low: 0-1.4 Volt; High: >2.1Volt; Transition state: 1.4-2.1Volt Positive logic: High voltage 1, Low voltage 0 Negative logic: Low voltage 1, High voltage 0

The Complement (NOT) DeMorgan: P11a: (a + b) = a b P11b: (ab) = a + b P11aa: (a + b + c ) = a b c P11bb: (abc ) = a + b + c + Note: (ab) a b (a + b) a + b ab + a b 1 18

Find the complement of a given function Repeatedly apply DeMorgan s theorem 1. Complement each variable (a to a or a to a) 2. Replace 0 by 1 and 1 by 0 3. Replace AND by OR, OR by AND, being sure to preserve the order of operations Practice: Example 2.5 (Page53) and Example 2.6 (page 54). 19

Example of Complement f = wx y + xy + wxz -- SOP f = (wx y + xy + wxz) = (wx y) (xy ) (wxz) = (w +x+y )(x +y)(w +x +z ) -- POS 20

Truth Table to Algebraic Expressions f is 1 f is 1 f is 1 ab = 1 if a = 0 AND b = 1 OR if a = 1 AND b = 0 OR if a = 1 AND b = 1 if a = 1 AND b = 1 OR if a = 1 AND b = 1 OR if a = 1 AND b = 1 if a b = 1 OR if ab = 1 OR if f = a b + ab + ab = a + b (OR)

A standard product term, also minterm is a product term that includes each variable of the problem, either uncomplemented or complemented. To obtain f (A, B, C), add all minterms with output = 1 (SOP): f (A, B, C) = m(1, 2, 3, 4,5) = A B C + A BC + A BC + AB C + AB C f (A, B, C) = m(0, 6, 7) = A B C + ABC + ABC f f 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1

A standard sum term, also called a maxterm, is a sum term that includes each variable of the problem, either uncomplemented or complemented. POS: f = (f ) = (A + B + C)(A +B +C)(A +B +C ) f f 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1

To simplify: f (A, B, C) = A B C + A BC + A BC + AB C + AB C = A B C + A B + AB = A (B C + B) + AB = A C + A B + AB = B C + A B + AB f (A, B, C) = A B C + ABC + ABC = A B C + AB P10a: B + C See page56 for details. P8a: a (b + c) = ab + ac P9a: ab + ab = a P10a: a + a b = a + b 24

25 Truth Table with don t care Include them as a separate sum. f (a, b, c) = m(1, 2, 5) + d(0, 3) What is the values of f? a b c f f 0 0 0 X 0 0 1 1 0 1 0 1 0 1 1 X 1 0 0 0 1 0 1 1 1 1 0 0 1 1 1 0

Number of different functions of n variables

Announcement: Review Chapter 2.3-2.5 HW2 is due on 9/21. Next class (Chapter 2.6-2.7): NAND, NOR, Exclusive-OR (EOR) Gates Simplification of Algebraic Expressions 27