Prof. YingLi Tian Sept. 10, 2012 Department of Electrical Engineering The City College of New York The City University of New York (CUNY) Lecture 4: Implementation.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Prof. Sin-Min Lee Department of Computer Science
Logical Systems Synthesis.
Chapter 2 Logic Circuits.
Boolean Algebra and Combinational Logic
Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
Boolean Algebra and Logic Gates1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
CSCE 211: Digital Logic Design
Chapter Two Boolean Algebra and Logic Gate
Chapter 2: Boolean Algebra and Logic Functions
CHAPTER 2 Boolean Algebra
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
Morgan Kaufmann Publishers
Chapter 2 Combinational Systems And / Or / Not. TRIAD PRINCIPLE: Combinational is about And / Or / Not combinations As well as equivalent functions. It.
1 Logic Gates Digital Computer Logic Kashif Bashir WWW:
ECE 331 – Digital System Design
2 - 1 Chapter 2 Combinational Systems Chapter 2 Combinational Systems 2.1 The Design Process for Combinational Systems  Continuing Example(CE)
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
Digital Logic Basics Chapter 2 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 
Logic Design Dr. Yosry A. Azzam.
Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Physics 343 Advanced Electronics Engineering 343 Digital Systems Electronics Courses.
Chap 2. Combinational Logic Circuits. Chap Binary Logic and Gates l 디지털 회로 (Digital circuits) o hardware components that manipulate binary information.
LOGIC GATES & BOOLEAN ALGEBRA
Chap 2. Combinational Logic Circuits
ES 244: Digital Logic Design Chapter 2 Chapter 2: Combinational Systems Adapted from Alan Marcovitz’s Introduction to Logic and Computer Design Uchechukwu.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
CEC 220 Digital Circuit Design Boolean Algebra Friday, January 17 CEC 220 Digital Circuit Design Slide 1 of 22.
Chapter 2: Basic Definitions BB inary Operators ●A●AND z = x y = x yz=1 if x=1 AND y=1 ●O●OR z = x + yz=1 if x=1 OR y=1 ●N●NOT z = x = x’ z=1 if x=0.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
Chapter 2 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. Combinational Systems.
Review. Boolean Algebra.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
Standard & Canonical Forms COE 202 Digital Logic Design Dr. Aiman El-Maleh College of Computer Sciences and Engineering King Fahd University of Petroleum.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
Boolean Algebra ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Table 2.1 Postulates and Theorems of Boolean Algebra
Chapter 2 Combinational Systems
Chapter 2: Boolean Algebra and Logic Functions
ECE 20B, Winter 2003 Introduction to Electrical Engineering, II LECTURE NOTES #2 Instructor: Andrew B. Kahng (lecture)
CS 105 Digital Logic Design
Gate Circuits and Boolean Equations
CHAPTER 2 Boolean Algebra
PROPAGATION DELAY.
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Boolean Algebra and Combinational Logic
Princess Sumaya University
CHAPTER 3 SETS AND BOOLEAN ALGEBRA
ECE 331 – Digital System Design
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Boolean Algebra.
Lecture 4 Sums of Product Circuits Simplification
Boolean Algebra.
Chapter 3 Gate-level Minimization.
Table 2.1 Postulates and Theorems of Boolean Algebra
Computer Architecture
Presentation transcript:

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

TA’s Students who didn’t receive TA’s , please send an to Mr. Zhang, by putting subject: “EE210 ” Mr. Chenyang Zhang Course website: ee.ccny.cuny.edu/www/web/yltian/EE2100.html 2

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 3

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

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.

Gate Implementation 6 P2b: a(bc) = (ab) c These three implementations are equal.

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) 7

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

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

Multi-level circuit 10 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 11

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 12

Positive and Negative Logic Use 2 voltages to represent logic 0 and 1 For example: Low: Volt; High: >2.1Volt; Transition state: Volt 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 14

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 See Example 2.5 (Page53) and Example 2.6 (page 54). 15

Example of Complement 16 f = wx´y + xy´ + wxz f ´ = (wx´y + xy´ + wxz)´ = (wx´y)´(xy´)´(wxz)´ = (w´+x+y´)(x´+y)(w´+x´+z´)

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

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

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

20 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´ To simplify: f ´(A, B, C) = A´B´C´ + ABC´ + ABC = A´B´C´ + AB See page56 for details. P9a: ab + ab´ = a P10a: a + a´ b = a + b P8a: a (b + c) = ab + ac P10a: B + C

Truth Table with don’t care Include them as a separate sum. 21 f (a, b, c) = ∑m(1, 2, 5) + ∑d(0, 3) abcf 000X X

Number of different functions of n variables

Announcement: Review Chapter HW2 is out today, due on 9/12. Next class (Chapter ): NAND, NOR, Exclusive-OR (EOR) Gates Simplification of Algebraic Expressions 23