CONSENSUS THEOREM Choopan Rattanapoka.

Slides:



Advertisements
Similar presentations
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 8 – Systematic Simplification.
Advertisements

CS2100 Computer Organisation K-maps: Finding PIs and EPIs (AY2014/5) Semester 2.
ECE 331 – Digital System Design Boolean Algebra (Lecture #3) The slides included herein were taken from the materials accompanying Fundamentals of Logic.
ECE 331 – Digital System Design
Examples Simplify: ab’c + abc + a’bc Show that X + X’Y = X + Y
CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.
ECE 301 – Digital Electronics Boolean Algebra and Standard Forms of Boolean Expressions (Lecture #4) The slides included herein were taken from the materials.
PMOS & nMOS pMOS is open when input is high. nMOS is closed when input is high. Always pMOS at top (high) and nMOS at botom (ground) implement F in pMOS.
CSCE 211: Digital Logic Design
CHAPTER 2 Boolean Algebra
Binary Logic and Gates Binary variables take on one of two values.
ECE 331 – Digital System Design
CT455: Computer Organization K-Map
Chapter 3 The Karnaugh Map. These K-maps are described by the location. Next, each square will be 1 or 0 depending on the value of the function. ABfm.
ECE 331 – Digital System Design
©2004 Brooks/Cole FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter in.
Module 4.  Boolean Algebra is used to simplify the design of digital logic circuits.  The design simplification are based on: Postulates of Boolean.
Chapter 2: Boolean Algebra and Logic Gates. F 1 = XY’ + X’Z XYZX’Y’XY’X’ZF1F
©2010 Cengage Learning CHAPTER 3 BOOLEAN ALGEBRA (continued) 3.1Multiplying Out and Factoring Expressions 3.2Exclusive-OR and Equivalence Operations 3.3The.
Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.
ECE 301 – Digital Electronics Basic Logic Operations, Boolean Expressions, and Boolean Algebra (Lecture #3)
6 - 1 Simplification Theorems Useful for simplification of expressions & therefore simplification of the logic network which results. XY + XY' = ( X +
©2004 Brooks/Cole FIGURES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter. This.
KFUPM COE 202: Digital Logic Design Combinational Logic Part 1 Courtesy of Dr. Ahmad Almulhem.
1 BOOLEAN ALGEBRA Basic mathematics for the study of logic design is Boolean Algebra Basic laws of Boolean Algebra will be implemented as switching devices.
Chap 2. Combinational Logic Circuits
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use ECE/CS.
© BYU 03 BA1 Page 1 ECEn 224 Boolean Algebra – Part 1.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
BOOLEAN ALGEBRA – Digital Circuit 1 Choopan Rattanapoka.
Module –I Boolean Algebra Digital Design Amit Kumar Assistant Professor SCSE, Galgotias University, Greater Noida.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 4: Cost of Logic Circuits and Karnaugh Maps José Nelson Amaral.
Review. Boolean Algebra.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
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.
1 CS 352 Introduction to Logic Design Lecture 2 Ahmed Ezzat Boolean Algebra and Its Applications Ch-3 + Ch-4.
©2010 Cengage Learning SLIDES FOR CHAPTER 3 BOOLEAN ALGEBRA (continued) Click the mouse to move to the next page. Use the ESC key to exit this chapter.
©2010 Cengage Learning SLIDES FOR CHAPTER 5 KARNAUGH MAPS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter.
ECE 331 – Digital System Design
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Computer Organisation
CHAPTER 3 BOOLEAN ALGEBRA (continued)
CHAPTER 2 Boolean Algebra
CS 352 Introduction to Logic Design
CSCE 211: Digital Logic Design
CHAPTER 2 Boolean Algebra This chapter in the book includes:
Lecture 3 Algebraic Simplification
Boolean Algebra – Part 1 ECEn 224.
SLIDES FOR CHAPTER 2 BOOLEAN ALGEBRA
FIGURES FOR CHAPTER 2 BOOLEAN ALGEBRA
Lecture 3: Boolean Algebra
CSCE 211: Digital Logic Design
Boolean Algebra.
CSCE 211: Digital Logic Design
COE 202: Digital Logic Design Combinational Logic Part 1
CSCE 211: Digital Logic Design
CSCE 211: Digital Logic Design
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Recapping: Vector addition.
Karnaugh Maps Introduction Venn Diagrams 2-variable K-maps
Chapter 3 Gate-level Minimization.
Fractional Factorial Design
CSCE 211: Digital Logic Design
CHAPTER 3 BOOLEAN ALGEBRA (continued)
CSCE 211: Digital Logic Design
Design matrix Run A B C D E
DIGITAL DESIGN MORRIS MANO UNIT 3 ANSWERS OF THE PROBLEMS 1-29
Presentation transcript:

CONSENSUS THEOREM Choopan Rattanapoka

Introduction to The Consensus Theorem The consensus theorem is very useful in simplifying Boolean expressions. Given an expression of the form XY + X’Z + YZ then term YZ is redundant and can be eliminated to form the equivalent expression XY + X’Z The eliminated term is referred to as the consensus term.

Consensus Term Given a pair of terms for which a variable appears in one term and the complement of that variable in another . The consensus term is formed by multiplying the two original terms together, leaving out the selected variable and its complement. Example : AB and A’C , consensus is BC ABD and B’DE’, consensus is (AD)(DE’)  ADE’

The consensus theorem (1) The consensus theorem can be stated as follows: XY + X’Z + YZ = XY + X’Z Proof XY + X’Z + YZ  XY + X’Z + (X + X’)YZ  XY + X’Z + XYZ + X’YZ  (XY + XYZ) + (X’Z + X’YZ)  XY(1 + Z) + X’Z(1 + Y)  XY + X’Z

The consensus theorem (2) Example : Simplify this expression A’B’ + AC + BC’ + B’C + AB Ans : A’B’ + AC + BC

The consensus theorem (3) The dual form of the consensus theorem is (X + Y)(X’ + Z)(Y + Z) = (X + Y)(X’ + Z) Example : (A + B + C’)(A + B + D’)(B + C + D’) The Consensus of (A + B + C’) and (B + C + D’) is (A + B + D’) Thus, we can eliminate the consensus term Answer : (A + B + C’)(A + B + D’)

Consensus Term Eliminating Order (1) Attention The final result obtained by application of the consensus theorem may depend on the order in which terms are eliminated. Example : A’C’D + A’BD + BCD + ABC + ACD’  Eliminate BCD terms (consensus of A’BD , ABC)  A’C’D + A’BD + ABC + ACD’ (No more eliminated term.)

Consensus Term Eliminating Order (2) Same Example : A’C’D + A’BD + BCD + ABC + ACD’  Eliminate A’BD terms (consensus of A’C’D , BCD)  A’C’D + BCD + ABC + ACD’  Eliminate ABC terms (consensus of BCD, ACD’)  A’C’D + BCD + ACD’ (no more eliminated term)

Trick to use consensus theorem Sometimes it is impossible to directly reduce an expression to a minimum number of terms by simply eliminating terms. It may be necessary to first add a term using the consensus theorem and then use the added term to eliminate other terms.

Example F = ABCD + B’CDE + A’B’ + BCE’ Consensus of ABCD and B’CDE  ACDE Consensus of A’B’ and BCE’  ACE’ But none of them appear in the original expression. However, if we first add the consensus ACDE to F F = ABCD + B’CDE + A’B’ + BCE’ + ACDE Consensus of ACDE and A’B’  B’CDE Consensus of ACDE and BCE’  ABCD Thus, F = A’B’ + BCE’ + ACDE

Exercise 1 Simplify each of the following expressions using only the consensus theorem BC’D’ + ABC’ + AC’D + AB’D + A’BD’ (reduce to 3 terms) W’Y’ + WYZ + XY’Z + WX’Y (reduce to 3 terms)

Algebraic Simplification (1) Combining terms XY + XY’ = X Example : abc’d’ + abcd’ = abd’ (X = abd’, Y = d) Complex example : ab’c + abc + a’bc  (X + X = X) ab’c + abc + abc + a’bc ac + bc

Algebraic Simplification (2) Eliminating terms X + XY = X Example : a’b + a’bc = a’b (X = a’b, Y = c) XY + X’Z + YZ = XY + X’Z (consensus theorem) a’bc’ + bcd + a’bd = a’bc’ + bcd (X = c, Y = bd, Z = a’b)

Algebraic Simplification (3) Eliminating literals X + X’Y = X + Y Simply factoring may be necessary before the theorem is applied Example : A’B + A’B’C’D’ + ABCD’ = A’(B + B’C’D’) + ABCD’ = A’(B + C’D’) + ABCD’ = A’B + AC’D’ + ABCD’ = B(A’ + ACD’) + AC’D’ = B(A’ + CD’) + AC’D’ = A’B + BCD’ + AC’D’

Algebraic Simplification (4) Adding redundant terms. Redundant terms can be introduced in several ways such as adding xx’ multiplying by (x + x’) Adding yz to xy+x’z Adding xy to x Example : WX + XY + X’Z’ + WY’Z’ = A’(B + B’C’D’) + ABCD’ = WX + XY + X’Z’ + WY’Z’ + WZ’ (add WZ’ by consensus term) = WX + XY + X’Z’ + WZ’ (WZ’ + WY’Z’  WZ’) = WX + XY + X’Z’ (eliminate WZ’ [consensus of WX and X’Z’])

TODO Simplify to a sum of three terms: A’C’D’ + AC’ + BCD + A’CD’ + A’BC + AB’C’ A’B’C’ + ABD + A’C + A’CD’ + AC’D + AB’C’