9/15/09 - L6 Standard FormsCopyright 2009 - Joanne DeGroat, ECE, OSU1 Standard Forms.

Slides:



Advertisements
Similar presentations
Combinational Logic Design
Advertisements

ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.
Logic Gate Level Part 2. Constructing Boolean expression from truth table First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result.
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.
EECC341 - Shaaban #1 Lec # 5 Winter Switching Algebra: Principle of Duality Any theorem or identity in switching algebra remains true if.
Boolean Algebra and Logic Gates
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.
EE365 Adv. Digital Circuit Design Clarkson University Lecture #2 Boolean Laws and Methods.
ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.
28/06/041 CSE-221 Digital Logic Design (DLD) Lecture-5: Canonical and Standard forms and Integrated Circuites.
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Chapter 2: Boolean Algebra and Logic Functions
9/15/09 - L5 Boolean AlgebraCopyright Joanne DeGroat, ECE, OSU1 Boolean Algebra.
Lecture 4 Logic gates and truth tables Implementing logic functions
1 COMBINATIONAL LOGIC One or more digital signal inputs One or more digital signal outputs Outputs are only functions of current input values (ideal) plus.
Switching functions The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to.
ECE 331 – Digital System Design
1 Representation of Logic Circuits EE 208 – Logic Design Chapter 2 Sohaib Majzoub.
9/15/09 - L7 Two Level Circuit Optimization Copyright Joanne DeGroat, ECE, OSU1 Two Level Circuit Optimiztion An easier way to generate a minimal.
Lecture 7 Topics –Boolean Algebra 1. Logic and Bits Operation Computers represent information by bit A bit has two possible values, namely zero and one.
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
Combinational Logic 1.
Ahmad Almulhem, KFUPM 2009 COE 202: Digital Logic Design Combinational Logic Part 2 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
Chapter 2: Boolean Algebra and Logic Gates. F 1 = XY’ + X’Z XYZX’Y’XY’X’ZF1F
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
9/15/09 - L4 Combinational Logic - Gates Copyright Joanne DeGroat, ECE, OSU1 Combinational Logic Circuits – Gates.
ECE 3110: Introduction to Digital Systems Symplifying Products of sums using Karnaugh Maps.
CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Venn Diagram – the visual aid in verifying theorems and properties 1 E.
Boolean Algebra AND gate A B | AB 0 0 | | | | 1 OR gate A B | A + B 0 0 | | | | 1 NOT gate _ A | A or A’ 0 | 1 1 |
1 Minterm and Maxterm Expressions Definition: a minterm of n variables is a product of the variables in which each appears exactly once in true or complemented.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 6 – Canonical Forms.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
Chap 2. Combinational Logic Circuits
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
ece Parity Used to check for errors Can be either ODD or EVEN Left most bit used as the indicator For EVEN, insert a 0 or a 1 so as to make the.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Boolean Algebra – II. Outline  Basic Theorems of Boolean Algebra  Boolean Functions  Complement of Functions  Standard Forms.
A. Abhari CPS2131 Chapter 2: Boolean Algebra and Logic Gates Topics in this Chapter: Boolean Algebra Boolean Functions Boolean Function Simplification.
Module –I Switching Function
Fundamentals of digital electronics Prepared by - Anuradha Tandon Assistant Professor, Instrumentation & Control Engineering Branch, IT, NU.
Binary Logic and Gates Boolean Algebra Canonical and Standard Forms Chapter 2: Boolean Algebra and Logic Gates.
Module 5.  In Module 3, you have learned the concept of Boolean Algebra which consists of binary variables and binary operator.  A binary variable x,
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.
BR 2/1/991 Truth Tables (again) Recall that a boolean equation can be represented by a Truth Table A B C F
Lecture 18: Boolean Algebra Boolean Functions. w = Chris is allowed to watch television x = Chris's homework is finished y = it is a school night z =
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.
ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
DeMorgan’s Theorem DeMorgan’s 2 nd Theorem The complement of a sum of variables is equal to the product of the complemented variables. A + B = A. B Applying.
Decoders Zhijian John Wang. What are they? Overview of a decoder A device that reverses the process of an encoder Convert information from one format.
Dr. ClincyLecture Slide 1 CS Chapter 3 (3A and ) Part 2 of 8 Dr. Clincy Professor of CS.
CSE 260 BRAC University.
CE1110: Digital Logic Design Gate Level Minimization Karnaugh Maps (K-Maps)
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
Complement of a Function
Give qualifications of instructors: DAP
Karnaugh Maps.
Boolean Algebra.
Lecture 14: Boolean Algebra
Digital Systems Design
MINTERMS and MAXTERMS Week 3
Analysis of Logic Circuits Example 1
Presentation transcript:

9/15/09 - L6 Standard FormsCopyright Joanne DeGroat, ECE, OSU1 Standard Forms

9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU2 Class 6 outline  Minterms and Maxterms  Sum of Products  Product of Sums  Material from section 2-3 of text

Binary Function Expression  So far have seen to possible ways Binary equations Truth tables  What other ways are there? 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU3

Standard Forms  Facilitate simplification  Result in more desirable implementations  Standard Forms rely on two type of terms Product Terms – Terms that are ANDed together  XYZ  (A+B)(C+D)(A+D) Sum Terms – Terms that are ORed together  X+Y+Z  XYZ + VX 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU4

Minterms  Boolean Functions can be defined by truth tables. In a Boolean function, a product term in which all the variables appear is called a minterm of the function.  Minterms specify the function as an OR of the minterms (product terms). 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU5

Minterm for 3 variables  Table 2-6 from text 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU6

Minterms for n variable functions  For 2 variables have 4 minterms X’Y’ X’Y XY’ XY  For 3 variables have 8 minterms X’Y’Z’ X’Y’Z … XYZ  In general, if a function has n variables there are 2 n minterms  The subscript on the minterm is the decimal of the binary value represented 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU7

Maxterms  A sum term that contains all the variables in complemented or un-complemented form is called a maxterm.  As before, if there a n variables then there are 2 n maxterms. 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU8

Maxterm table  The maxterms 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU9

Specifying functions  Functions can be specified in minterm or maxterm notation  Minterm F(X,Y,Z) = ∑m(0,2,5,7) = X’Y’Z’ + X’YZ’ + XY’Z + XYZ And then you can work on simplifying this Or could have also had F(X,Y,Z) = m 0 + m 2 + m 5 + m 7 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU10

More examples  From text F(X,Y,Z)’ = ∑m(1,3,4,6) = (m 1 +m 3 +m 4 +m 6 ) Or complementing both sides of the equation F(X,Y,Z) = (m 1 +m 3 +m 4 +m 6 )’ By DeMorgan’s = m 1 ’ · m 3 ’ · m 4 ’ · m 6 ’ = M 1 · M 3 · M 4 · M 6 As m j ’ = M j 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU11

And to continue  Then have:  F(X,Y,Z) = M 1 · M 3 · M 4 · M 6  =(X+Y+Z’)(X+Y’+Z’)(X’+Y+Z)(X’+Y’+Z)  Another expression form for the function as a product of maxterms  F(X,Y,Z) = ∏M (1,3,4,6) 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU12

Another example  Express the function F(A,B,C) = AB+A’C in minterm notation  First expand to where each term has all three variables in it.  AND term with 1 to expand. For the 1 st term 1= (C+C’) and for the 2 nd the 1 is (B+B’)  Now have F(A,B,C)=AB(C+C’) + A’C(B+B’) F(A,B,C)=ABC + ABC’ + A’BC + A’B’C = m 7 + m 6 + m 3 + m 1 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU13

Summary of important properties  Most important properties of minterms: There are 2 n minterms for n Boolean variables. These minterms can be generated from the binary numbers from 0 to 2 n -1 Any Boolean function can be expressed as a logical sum of minterms. The complement of a function contains those minterms not included in the original function. A function that contains all 2 n minterms is equal to a logical 1. 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU14

Expansion of another function  Express E = Y’ + X’Z’ in minterm notation. E = (X+X’)Y’ + X’Z’(Y+Y’) = XY’(Z+Z’) + X’Y’(Z+Z’)+X’YZ’+X’Y’Z’ = XY’Z+XY’Z’+X’Y’Z+X’Y’Z’+X’YZ’ = m 5 + m 4 + m 1 + m 0 + m 2 = m 5 + m 4 + m 2 + m 1 + m 0  Text shows how to find the minterm expression using a truth table. 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU15

Using a truth table  E = Y’ + X’Z’  Have those entries that are Y’   Those that are X’Z’   giving  9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU16

Sum-of-Products  Starting with the minterm specification of a function F(X,Y,Z) = ∑m(2,3,4,7) = (m 2 +m 3 +m 4 +m 7 ) = X’YZ’ + X’YZ + XY’Z’ + XYZ  Each minterm represents a product term and then we sum them to generate the function.  This form is called sum-of-products.  Even when in minimal form it is still the sum-of- products. 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU17

Producing sum-of-products  Form other form of the function F = AB + C(D + E) Can distribute the C F = AB + CD + CE And now have the function in sum-of-products form. The sum-of-products form is a 2 level implementation of the function in gates 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU18

Product-of-sums  What the local grocer does?  This form arises from the Maxterm representation of a function. F(X,Y,Z) = ∏M (2,3,4,6) = (X+Y’+Z)(X+Y’+Z’)(X’+Y+Z)(X’+Y’+Z)  And now have F in a product-of-sums form  Once again, a 2 level circuit. 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU19

Class 6 assignment  Covered section 2-3  Problems for hand in  Problems for practice 2-10  Reading for next class: section 2-4 9/15/09 - L6 Standard Forms Copyright Joanne DeGroat, ECE, OSU20