![Complement of a Function
The complement of a function F is F’ and is obtained
from an interchange of 0’s for 1’s and 1’s for 0’s in the
value of F.
Examples
(A + B + C)’ = A’B’C’
F’ = (x’yz’+x’y’z)’ = (x’yz’)’(x’y’z)’ = (x+y’+z)(x+y+z’)
F’ = [x(y’z’ + yz)]’ = x’ + (y’z’ + yz)’ = x’ + (y’z’)’(yz)’
= x’ + (y+z)(y’+z’)
A simpler procedure for deriving the complement of
a function is to take the dual of the function and
complement each literal.](https://image.slidesharecdn.com/booleanalgebra-241012205808-2f6dade4/85/boolean_algebra-ppt-of-all-of-us-and-the-family-will-not-even-have-to-worry-23-320.jpg)
boolean_algebra.ppt of all of us and the family will not even have to worry
- 1. ATTY. MANUEL O. DIAZ JR. Boolean Algebra & Logic Gates
- 2. Basic Definitions Boolean algebra, like any other deductive mathematical system, may be defined with a set of elements, a set of operators, and a number of unproved axioms or postulates. A set of elements is any collection of objects having a common property. If S is a set and x and y are certain objects, then x S denotes that x is a member of the set S, and y S denotes that y is not an element of S.
- 3. Basic Definitions A set with a denumerable number of elements is specified by braces: A = {1,2,3,4}, i.e. the elements of set A are the numbers 1, 2, 3, and 4. A binary operator defined on a set S of elements is a rule that assigns to each pair of elements from S a unique element from S. Example: In a*b=c, we say that * is a binary operator if it specifies a rule for finding c from the pair (a,b) and also if a, b, c S.
- 4. Closure A set S is closed with respect to a binary operator if, for every pair of elements of S, the binary operator specifies a rule for obtaining a unique element of S. For example, the set of natural numbers N = {1, 2, 3, 4, … 9} is closed with respect to the binary operator plus (+) by the rule of arithmetic addition, since for any a, b N we obtain a unique c N by the operation a + b = c.
- 5. Associative Law A binary operator * on a set S is said to be associative whenever (x * y) * z = x * (y * z) for all x, y, z S
- 6. Commutative Law A binary operator * on a set S is said to be commutative whenever x * y = y * x for all x, y, z S
- 7. Identity Element A set S is said to have an identity element with respect to a binary operation * on S if there exists an element e S with the property e * x = x * e = x for every x S
- 8. Inverse A set S having the identity element e with respect to a binary operator * is said to have an inverse whenever, for every x S, there exists an element y S such that x * y = e
- 9. Distributive Law If * and are two binary operators on a set S, * is said to be distributive over whenever x * (y z) = (x * y)(x * z)
- 10. Huntington Postulates Closure with respect to the operator + and Identity element with respect to + (0) and (1) Commutative with respect to + and Distributive over + and For every element of x B, there exists an element x’ B such that (a) x + x’ = 1 and (b) x x’ = 0. There exists at least two elements x, y B such that x y.
- 11. Boolean Algebra vs Ordinary Algebra Huntington postulates do not include the associative law. However, this law holds for Boolean algebra. The distributive law of + over is valid for Boolean algebra but not for ordinary algebra. Boolean algebra does not have additive or multiplicative inverses, no subtraction or division. The operator complement is not available in ordinary algebra. Ordinary algebra deals with real numbers, Boolean algebra deals with only two elements.
- 12. Two-Valued Boolean Algebra A two-valued Boolean algebra is defined on a set of two elements, B = {0,1} with rules for the two binary operators + and as shown in the following operator tables: Verify that the Huntington postulates hold true. xy xy xy x+y x x' 00 0 00 0 0 1 01 0 01 1 1 0 10 0 10 1 11 1 11 1
- 13. Basic Theorems & Properties of Boolean Algebra Duality Principle states that every algebraic expression deducible from the postulates of Boolean algebra remains valid if the operators and identity elements are interchanged. Postulates a and b Postulate 2 x + 0 = x x 1 = x Postulate 3, Commutative x + y = y + x xy = yx Postulate 4, Distributive x (y + z) = xy + xz x + yz = (x + y)(x + z) Postulate 5 x + x’ = 1 x x’ = 0
- 14. Basic Theorems & Properties of Boolean Algebra Theorems a and b Theorem 1 x + x = x x x = x Theorem 2 x + 1 = 1 x 0 = 0 Theorem 3, Involution ( x’ )’ = x Theorem 4, Associative x + (y + z) = (x + y) + z x (y z) = (x y) z Theorem 5, DeMorgan (x + y)’ = x’y’ (xy)’ = x’ + y’ Theorem 6, Absorption x + xy = x x (x + y) = x
- 15. Proof of Theorem 1(a) x + x = x x + x = (x + x) 1 by postulate 2(b) = (x + x) (x + x’) by postulate 5(a) = x + xx’ by postulate 4(b) = x + 0 by postulate 5(b) = x by postulate 2(a)
- 16. Operator Precedence Parenthesis NOT AND OR
- 17. Venn Diagram x y xy’ xy x’y x’y’
- 18. Boolean Function A Boolean function is an expression formed with binary variables, the two binary operators OR and AND, the unary operator NOT, parenthesis, and equal sign. A binary variable can take the value of 0 or 1, and for a given value of the variables, the function can be either 0 or 1.
- 19. Truth Table Any Boolean function can be represented in a truth table, where the number of rows is 2n , and n is the number of binary variables in the function. Example: F = x + y’z x y z F 0 0 0 0 0 0 1 1 0 1 0 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 1
- 20. Logic Diagram y z F x Logic diagram for F = x + y’z
- 21. Algebraic Manipulation A literal is a primed or unprimed variable. When a Boolean function is implemented with logic gates, each literal in the function designates an input to a gate, and each term is implemented with a gate. The minimization of the number of literals and the number of terms results in a circuit with less equipment.
- 22. Algebraic Manipulation: Examples x + x’y = (x + x’)(x + y) = 1 (x + y) = x + y x(x’ + y) = xx’ + xy = 0 + xy = xy x’y’z + x’yz + xy’ = x’z(y’ + y) + xy’ = x’z + xy’ xy + x’z + yz = xy + x’z + yz(x + x’) = xy + x’z + xyz + x’yz = xy(1 + z) + x’z(1 + y) = xy + x’z (x + y)(x’ + z)(y + z) = (x + y)(x’ + z) by duality.
- 23. Complement of a Function The complement of a function F is F’ and is obtained from an interchange of 0’s for 1’s and 1’s for 0’s in the value of F. Examples (A + B + C)’ = A’B’C’ F’ = (x’yz’+x’y’z)’ = (x’yz’)’(x’y’z)’ = (x+y’+z)(x+y+z’) F’ = [x(y’z’ + yz)]’ = x’ + (y’z’ + yz)’ = x’ + (y’z’)’(yz)’ = x’ + (y+z)(y’+z’) A simpler procedure for deriving the complement of a function is to take the dual of the function and complement each literal.
- 24. Minterms A binary variable may appear either in its normal form (x) or in its complement form (x’). Consider two binary variables x and y combined with an AND operation. Since each variable may appear in either the normal or complementary form, there are four possible combinations: xy, xy’, x’y, and xy. Each is called a minterm or standard product. Any Boolean function can be expressed as a sum of minterms (by sum is meant the ORing of terms). n variables can be combined to form 2n minterms.
- 25. Maxterms n variables forming an OR term, with each variable being primed or unprimed, provide 2n possible combinations, called max terms or standard sums. Any Boolean function can be expressed as a product of maxterms (by product is meant the ANDing of terms). Each maxterm is the complement of its corresponding minterm, and vice versa. Boolean functions expressed as a sum of minterms or product of maxterms are said to be in canonical form.
- 26. Minterms & Maxterms for 3 Binary Variables Minterms Maxterms x y z Term Designation Term Designation 0 0 0 x’y’z’ mo x+y+z Mo 0 0 1 x’y’z m1 x+y+z’ M1 0 1 0 x’yz’ m2 x+y’+z M2 0 1 1 x’yz m3 x+y’+z’ M3 1 0 0 xy’z’ m4 x’+y+z M4 1 0 1 xy’z m5 x’+y+z’ M5 1 1 0 xyz’ m6 x’+y’+z M6 1 1 1 xyz m7 x’+y’+z’ M7
- 27. Canonical Form The function F1 = x’y’z + xy’z’ + xyz is in canonical form. It can be written as F1 = m1 + m4 + m7 or in short notation, F1 = Σ(1,4,7). The function F2 = (x + y + z)(x + y + z’)(x + y’ + z) is likewise in canonical form. It can be written as F2 = M0 + M1 + M2 or in short notation, F2 = π(0,1,2). mj’ = Mj which means that F(x,y,z) = π(0,2,4,5) = Σ(1,3,6,7) and that F’(x,y,z) = Σ(0,2,4,5) = π(1,3,6,7).
- 28. Standard Form The sum of products is a Boolean expression containing AND terms, called product terms, of one or more literals each. The sum denotes ORing of these terms. Ex. F1 = y’ + xy + x’yz’ A product of sums is a Boolean expression containing OR terms, called sum terms. Each term may have any number of literals. The product denotes the ANDing of these terms. Ex. F2 = x(y’ + z)(x’ + y + z’ + w)
- 29. Conversion Between Forms From sum of products, obtain standard products by using Postulate 2(b) and Postulate 5(a). From product of sums, obtain standard sums by using Postulate 2(a) and Postulate 5(b). From sum of products to product of sums and vice versa, use Postulate 4.
- 30. Other Logic Operations F0 = 0 Null, binary constant 0 F1 = xy = xy AND, x and y F2 = xy’ = x/y Inhibition, x but not y F3 = xTransfer, x F4 = xy’+x’y = xy Exclusive-OR, x or y but not both F5 = x+y OR, x or y F6 = (x+y)’ = xy NOR, Not-OR F7 = xy+x’y’ = xy Equivalence, x equals y F8 = x’ Complement, Not x
- 31. Other Logic Operations F9 = x’+y = xy Implication, if x then y F10 = (xy)’ = xy NAND, Not-AND F11 = 1 Identity, binary constant 1
- 32. AND x y F 0 0 0 0 1 0 1 0 0 1 1 1
- 33. OR x y F 0 0 0 0 1 1 1 0 1 1 1 1
- 34. INVERTER x F 0 1 1 0
- 35. BUFFER x F 0 0 1 1
- 36. NAND x y F 0 0 1 0 1 1 1 0 1 1 1 0
- 37. NOR x y F 0 0 1 0 1 0 1 0 0 1 1 0
- 38. XOR x y F 0 0 0 0 1 1 1 0 1 1 1 0
- 39. XNOR x y F 0 0 1 0 1 0 1 0 0 1 1 1
- 40. PREPARE FOR A LONG TEST. End of Chapter 2