Scribd
Upload
19 views38 pages

3 Boolean Algebra

Boolean algebra is a deductive mathematical system used to analyze binary systems. It was developed by George Boole in 1854 and introduced switching algebra by Claude Shannon in 1938. Boolean algebra uses operators like AND, OR, and NOT to manipulate variables that can only have true or false values. Functions in Boolean algebra can be expressed in canonical forms like sum of minterms or product of maxterms. Standard logic gates like AND, OR, NAND, NOR, XOR can be used to physically implement Boolean functions and expressions.

Uploaded by

EUGENE KARL REPOPONIO
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
19 views38 pages

3 Boolean Algebra

Boolean algebra is a deductive mathematical system used to analyze binary systems. It was developed by George Boole in 1854 and introduced switching algebra by Claude Shannon in 1938. Boolean algebra uses operators like AND, OR, and NOT to manipulate variables that can only have true or false values. Functions in Boolean algebra can be expressed in canonical forms like sum of minterms or product of maxterms. Standard logic gates like AND, OR, NAND, NOR, XOR can be used to physically implement Boolean functions and expressions.

Uploaded by

EUGENE KARL REPOPONIO
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 38

BOOLEAN ALGEBRA

BOOLEAN ALGEBRA

• It is a deductive mathematical system may be defined with a


set of elements of operators and a number of unproved axioms
or postulates.
• George Boole developed Boolean Algebra in 1854
• Claude E. Shannon introduced a two-valued Boolean algebra
in 1938 called switching algebra that represented the
properties of bistable electrical switching circuits.
• E. V. Huntington formulated the postulates in 1904
AXIOMATIC DEFINITION OF BOOLEAN
ALGEBRA
BOOLEAN VS ORDINARY ALGEBRA
BASIC THEOREMS AND 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.
• Basic Theorems
OPERATOR PRECEDENCE

• Parenthesis ( )
• NOT
• AND
• OR

• Ex. (x + yz)’
BOOLEAN FUNCTION

• Boolean algebra
• is an algebra that deals with binary variables and logic operations
• Boolean function
• Expresses the logical relationship between binary variables and is
evaluated by determining the binary value of the expression for all
possible values of the variables.

• Ex. F = x + y’z
BOOLEAN FUNCTION CONT…

• F = x + y’z
• Truth Table => number of rows is determined through 2n
where n is the number of variables in a function.

•Logic diagram
ALGEBRAIC MANIPULATION

• reducing an expression for the purpose of


obtaining a simpler circuit.
Ex. F2 = x’y’z + x’yz + xy’

Applying some identities of boolean algebra


F2 = x’y’z + x’yz + xy’
= x’z(y’+y) + xy’
= x’z + xy’ answer
IMPLEMENTATION OF BOOLEAN
FUNCTION F2 WITH GATES
SIMPLIFYING BOOLEAN EXPRESSION

• Ex.
• 1. xy + xy’

• 2. (a + b + c’)(a’ b’ + c)

• 3. A’B(D’ + C’D) + B(A + A’CD)  1 LITERAL


COMPLEMENT OF A FUNCTION

• F = F’
• Obtained from an interchange of 0’s and 1’s
• Applying DeMorgan’s theorems achieves complement of a function.
• Ex.
• (A + B + C) = (A + B + C)’ = A’B’C’
IN SHORT:
• The generalized form of DeMorgan’s theorems states that the complement
of a function is obtained by interchanging AND and OR operators and
complementing each literal.
COMPLEMENT OF A FUNCTION

• Find the complement of the function


• F1 = x’yz’ + x’y’z

• F2 = x(y’z’ + yz)
CANONICAL AND STANDARD FORMS

• Minterms or standard product


• Product of n-binary variables in a function
• Ex. 2 binary variables which forms 22 minterms
(x’y’, xy’, x’y & xy)
• Binary Variables being primed = 0 => x’y’ means 00
• Binary Variables being unprimed = 1 => xy means 11
• Maxterms or standard sum
• Sum of n-binary variables in a function
• Ex. 2 binary variables with 22 maxterms
(x+y),(x+y’),(x’+y), &(x’ + y’)
• Variables being primed = 1 => (x’ + y’) means 1 + 1
• Variables being unprimed = 0 => (x + y) means 0 + 0
MINTERMS VS MAXTERMS
SUM OF MINTERMS

• A Boolean function can be expressed algebraically from a


given truth table by forming a minterm for each combination
of the variables that produces a 1 in the function and then
taking the OR of all those terms.
• In other words, Boolean function can be expressed as sum of
minterms
• Sum meaning the ORing of terms.
DERIVING BOOLEAN FUNCTION FROM THE TRUTH
TABLE

• f1 = x’y’z + xy’z’ + xyz


• = m1 + m 4 + m 7
• f2 = x’yz + xy’z + xyz’ + xyz
• = m3 + m 5 + m 6 + m 7
DERIVING THE COMPLEMENT OF A BOOLEAN
FUNCTION FROM THE TRUTH TABLE

• f1’ = x’y’z‘ + x’yz’ + x’yz + xy’z +xyz’


• = m0 + m 2 + m 3 + m 5 + m 6
• f2’ = x’y’z’ + x’y’z + x’yz’ + xy’z’
• = m0 + m 1 + m 2 + m 4
PRODUCT OF MAXTERMS

• f1’ = x’y’z‘ + x’yz’ + x’yz + xy’z +xyz’


• = m0 + m 2 + m 3 + m 5 + m 6

Taking the complement of the above functions will obtain the product of
maxterms of f1
• Product meaning the ANDing of terms

(f1’)’ = (x’y’z‘ + x’yz’ + x’yz + xy’z +xyz’)’


f1 = (x+y+z)(x+y’+z)(x+y’+z’)(x’+y+z’)(x’+y’+z)
f1= M0•M2•M3•M5•M6
PRODUCT OF MAXTERMS

• f2’ = x’y’z’ + x’y’z + x’yz’ + xy’z’


• = m0 + m 1 + m 2 + m 4

Taking the complement of the above functions will obtain the


product of maxterms of f2

(f2’)’ = (x’y’z‘ + x’yz’ + x’yz + xy’z +xyz’)’


f2 = (x+y+z)(x+y’+z)(x+y’+z’)(x’+y’+z)
f1= M0•M2•M3•M5•M6
CANONICAL FORMS

Hence:
Sum of Minterms
or
Product of Maxterms

Are said to be in Canonical Forms


EXPRESSING THE FOLLOWING
FUNCTION AS A SUM OF MINTERMS
• When a function is not in the form of sum of minterms or it is
in the form of AND terms
• Procedure:
• Count the number of unique literals in a function
• Inspect to see if each terms contains all the variables
• If missing one or more variable, expand the term by anding with an
expression of missing variables such as x + x’ if x is the missing
variable.
EXAMPLE 1

• F = A + B’C
• 3 variables
• 1st term has two missing variables B and C
• 2nd term has one missing variable A
• Therefore: (EXPAND AND DISTRIBUTE)
• F = A + B’C = A(B+B’)(C+C’) + B’C(A+A’)
• = ABC + ABC’ + AB’C + AB’C’ + AB’C + A’B’C
• = ABC + ABC’ + AB’C + AB’C’ + A’B’C
• ARRANGE IN ASCENDING ORDER
F = A’B’C + AB’C’ + AB’C + ABC’ + ABC
F = m 1 + m4 + m5 + m6 + m7
F = Σ(1,4,5,6,7)
EXAMPLE 1 ALTERNATE PROCEDURE

• Obtain the truth table of the function directly from the


algebraic expression and then read the minterms from the
truth table whose function is 1.
• Therefore:

• F = Σ(1,4,5,6,7)
EXPRESSING THE FOLLOWING FUNCTION
AS A PRODUCT OF MAXTERMS
• To express a Boolean function as a product of maxterms,
• it must first be brought into a form of OR terms. This may be
done by using the distributive law,
• x + yz = (x + y)(x + z).
• Then any missing variable x in each OR term is ORed with
xx’.
EXAMPLE 1

• F = xy + x’z
• (expand by applying distributive law of OR over AND)
CONVERSION BETWEEN CANONICAL
FORMS
• F(A, B, C) = Σ(1, 4, 5, 6, 7)
• F’(A, B, C) = Σ(0, 2, 3) => COMPLEMENT
• F’(A, B, C) = m0 + m2 + m3
• (F’)’(A, B, C) = (m0 + m2 + m3)’ => involution
• F(A, B, C) = m0‘• m2‘• m3‘
• F(A, B, C) = M0• M2• M3 => where: mj’=Mj
• F(A, B, C) = ᴨ(0, 2, 3)
STANDARD FORMS

• SUM OF PRODUCTS
• A boolean expression containing AND terms called product terms with
one or more literals each term.
• Ex. F1 = y’ + xy + x’yz’
• The following circuit diagram configured as two-level implementation
where variables are directly available in their complements.
STANDARD FORMS

• PRODUCT OF SUMS
• is a Boolean expression containing OR terms, called sum terms. Each
term may have any number of literals.
• Ex. F2 = x(y’ + z)(x’ + y + z’)
• The following is its circuit diagram in two-level
implementation
NON STANDARD FORM

• A Boolean function may be expressed in a nonstandard form.


• It is neither in sum of products or product of sums.
• Ex. F3 = AB + C(D + E) = AB + CD + CE
• Its equivalent logic diagram is in three level implementation
OTHER LOGIC OPERATIONS
THEIR EQUIVALENT TRUTH TABLE
DIGITAL LOGIC GATES
EXTENSION TO MULTIPLE INPUTS

• A gate can be extended to have multiple inputs if the binary


operation it represents is commutative and associative.

• AND, & NOR gates are both commutative and associative


• Therefore, its inputs can be extended without affecting its outputs.
• NAND, & NOR gates are both commutative but not
associative
• Therefore their gates can be extended to have more than two inputs,
provided that the definition of the operation is modified
slightly.
EXTENSION TO MULTIPLE INPUTS
CONT…
• 3 input NOR => [(x + y)’+ z]’ not equal to [x + (y+ z)’]’

• 3 input NAND => [(xy)’z]’ not equal to [x(yz)’]’


CONT…

• To overcome this difficulty, multiple NOR (or NAND) gate


are defined as a complemented OR (or AND) gate. Thus, by
definition, we have
• (xyz)’ =>NAND
• (x+y+z)’=>NOR
CONT…

• XOR gate
• The exclusive‐OR and equivalence gates are both
commutative and associative and can be extended to more
than two inputs.
END

You might also like