05 – Boolean Function

EMT 125 DIGITAL ELECTRONIC PRINCIPLES 1

 Boolean Function
Contents

• Boolean Operations & Expression

• Laws & Rules of Boolean algebra
• DeMorgan’s Theorems
• Boolean analysis of logic circuits
• Simplification using Boolean Algebra
• Standard forms of Boolean Expressions
• Boolean Expressions & truth tables
 Boolean Operations & Expression

Expression

Variable
 a symbol used to represent logical quantities (1 or 0)
 E.g : A, B,..used as variable

Complement
 inverse of variable and is indicated by bar over variable
 E.g : Ā
 Boolean Operations & Expression

Operation

Boolean Addition
– equivalent to the OR operation A
X
B
X=A+B

Boolean Multiplication
– equivalent to the AND operation
A
X
X = A ∙B B
 Laws of Boolean Algebra

 Commutative
 Addition & multiplication

 Associative
 Addition & multiplication

 Distributive
 Same as ordinary algebra
 Commutative Law
Addition

Commutative law of addition:

A+B = B+A
the order of OR-ing does not matter.
 Commutative Law

Multiplication
Commutative law of Multiplication
AB = BA
the order of AND-ing does not matter.
 Associative Law

Addition

Associative law of addition

A + (B + C) = (A + B) + C
The grouping of OR-ed variables does not matter
 Associative Law

Multiplication

Associative law of multiplication

A(BC) = (AB)C
The grouping of AND-ed variables does not matter
 Distributive Law
A(B + C) = AB + AC

Usually, involving two binary operations, i.e. multiplication and

addition, in which the product of an element with a sum of terms is
equal to the sum of the individual products of that element with each
term.
 Rules of Boolean Algebra

Rule 1: A + 0 = A

In math if you add 0 you have changed nothing.

In Boolean Algebra OR-ing with 0 changes nothing.
 Rules of Boolean Algebra
Rule 2: A + 1 = 1

OR-ing with 1 must give a 1 since if any input

is 1 an OR gate will give a 1.
 Rules of Boolean Algebra

Rule 3: A . 0 = 0

In math if 0 is multiplied with anything you

get 0. If you AND anything with 0 you get 0.
 Rules of Boolean Algebra

Rule 4: A . 1 = A

AND-ing anything with 1 will yield the anything.

 Rules of Boolean Algebra

Rule 5: A + A = A

OR-ing with itself will give the same result

 Rules of Boolean Algebra
Rule 6: A + A = 1

Either Α or A must be 1 so A + A = 1
 Rules of Boolean Algebra

Rule 7: A . A = A

AND-ing with itself will give the same result

 Rules of Boolean Algebra

Rule 8: A . A = 0
In digital Logic 1 = 0 and 0 = 1,
so A A = 0 since one of the inputs must be 0.
 Rules of Boolean Algebra

Rule 9: A = A

If you NOT something twice, you are back to

the beginning
 Rules of Boolean Algebra
Rule 10: A + AB = A

Proof:
A + AB = A (1 + B) DISTRIBUTIVE LAW

= A∙1 RULE 2: (1+B) = 1

=A RULE 4: A∙1 = A
 Rules of Boolean Algebra
Rule 11: A + AB = A + B
If A is 1 the output is 1 , If A is 0 the output is B

Proof:
A + AB = (A + AB) + AB RULE 10
= (AA +AB) + AB RULE 7
= AA + AB + AA +AB RULE 8
= (A + A)(A + B) FACTORING
= 1∙(A + B) RULE 6
=A+B RULE 4
 Rules of Boolean Algebra
Rule 12: (A + B) (A + C)= A + BC

PROOF
(A + B)(A +C) = AA + AC +AB +BC DISTRIBUTIVE LAW
= A + AC + AB + BC RULE 7
= A(1 + C) +AB + BC FACTORING
= A.1 + AB + BC RULE 2
= A(1 + B) + BC FACTORING
= A.1 + BC RULE 2
= A + BC RULE 4
 Rules of Boolean Algebra
SUMMARY - LAWS OF BOOLEAN ALGEBRA

[1] COMMUTATIVE:
A+B=B+A
AB = BA

[2] ASSOCIATIVE:
A + (B + C) = (A + B) + C
A(BC) = (AB)C

[3] DISTRIBUTIVE:
A(B + C) = AB + AC
(A + B)(C + D) = AC + AD + BC + BD
 Rules of Boolean Algebra
SUMMARY - RULES OF BOOLEAN ALGEBRA

[1] A + 0 = A [7] A.A = A

[2] A + 1 = 1 [8] A.A = 0

[3] A.0 = 0 [9] A = A

[4] A.1 = A [10] A + AB = A

[5] A + A = A [11] A + AB = A + B

[6] A + A = 1 [12] (A + B)(A + C) = A + BC

 Example:
Use Boolean algebra rules and
simplified the equation.
 DeMorgan’s Theorems

 Two most important theorems of Boolean Algebra were

contributed by De Morgan
 Extremely useful in simplifying expression in which Product-
of-Sum (POS) of variables is inverted
 The TWO theorems are:

X.Y = X + Y & X+Y = X . Y

 DeMorgan’s Theorems
• To apply De-Morgan theoram, break the bar over the
product of variables and change the sign from AND to
OR
 DeMorgan’s Theorems

(a) & (b) Equivalent circuit implied by the theorem

X.Y = X + Y (c) Alternative symbol for the NAND function
(d) Truth table that illustrates DeMorgan’s Theorem

Input Output
X Y XY X+Y
0 0 1 1
0 1 1 1
1 0 1 1
(d) 1 1 0 0
 DeMorgan’s Theorems
(a) & (b) Equivalent circuit implied by the theorem
X+Y = X . Y (c) Alternative symbol for the NOR function
(d) Truth table that illustrates DeMorgan’s Theorem

Input Output
X Y X+Y XY
0 0 1 1
0 1 0 0
1 0 0 0

(d) 1 1 0 0
 DeMorgan’s Theorems
Gate equivalencies and the corresponding truth tables that illustrate
DeMorgan’s theorems.
From Logic Circuit  Boolean Algebra
Design a logic circuit using 2 inputs
logic gate for each of the question:

1. ( A + B + C )D
2. ABC + DEF
3. AB + C D + EF
Simplification Effect
 Solve this..

(a) Determine the Boolean expression for the above

circuit.
(b) Simplify the Boolean expression obtained in (a).
 Solve this..
• Simplify the following Boolean expressions:
• (AB(C + BD) + AB)C
• ABC + ABC + ABC + ABC + ABC

• Write the Boolean expression of the following circuit.

 Standard Forms of Boolean Expressions

 Sum-of-products (SOP)
Refer to two or more product terms, summed (added) by
Boolean addition

 Product-of-sums (POS)
Refer to multiplication of two or more sum terms
 Sum-of-products (SOP)

• In an SOP expression, a single overbar cannot extend over

more than one variable
 Sum-of-products (SOP)
The standard SOP form

Refer to expression in which all the variables in the

domain appear in each product term in the
expression

Example:

ABCD + ABCD + ABCD (standard SOP expression)

ABC + ABD + ABCD (non-standard SOP expression)

 Sum-of-products (SOP)
The standard SOP form
 All variables appear in each product term.
 Each of the product term in the expression is called
as minterm.
Example f ( A, B, C )  ABC  ABC  ABC

In compact form, f(A,B,C) may be written as

f ( A, B, C )  m2  m3  m6
f ( A, B, C )  m(2,3,6)
 Product-of-sums (POS)

• In a POS expression, a single overbar cannot extend over

more than one variable
 Standard Forms of Boolean Expressions

The standard POS form

Refer to expression in which all the variables in the

domain appear in each sum term in the expression

Example:

(A + B + C + D)(A + B + C + D)
(standard POS expression)

(A + B + C)(B + C + D)(A + B + C + D)
(non-standard POS expression)
 Standard Forms of Boolean Expressions

The standard POS form

• All variables appear in each product term.
• Each of the product term in the expression is
called as maxterm.
Example: f ( A, B, C )  ( A  B  C )  ( A  B  C )  ( A  B  C )

In compact form, f(A,B,C) may be written as

f ( A, B, C )  M 1M 4 M 5
f ( A, B, C )  M (1,4,5)
 Solve this..
Identify each of the following expressions as SOP,
standard SOP, POS or standard POS:
(i) AB + ABD + ACD
(ii) (A + B + C)(A + B + C)
(iii) ABC + ABC
(iv) A(A + C)(A + B)
Convert the following Boolean expressions to SOP
form:
(i) (A + B)(B + C + D)
(ii) AB + B(CD + EF)
 Converting Product Terms to Standard
SOPs
Each product term that does not contain all variables in the
domain has to be expanded.

Use:
A A 1
1. Multiply each nonstandard product term by a term made up
of the sum of a missing variable and its complement (use
Boolean rule above).
2. Repeat (1) until all resulting product terms contain all
variables in the domain (either in complemented or
noncomplemented forms).

• Tip: The no. of product terms is doubled for each missing variable
 Example (Standard SOP)
Convert the following Boolean expressions into standard
SOP form:

AB + ABCD
Solution

1st step: AB = AB (C + C) = ABC + ABC

2nd step: ABC (D + D) + ABC (D + D)

= ABCD + ABCD + ABCD + ABCD

3rd step: ABCD + ABCD + ABCD + ABCD + ABCD

 Converting Sum Terms to
Standard POS
Each sum term that does not contain all variables in the domain
has to be expanded.

Use:
A.A = 0
1. Add to each nonstandard product term, a term made up of the
product of the missing variable and its complement (use Boolean
rule above).
2.
A  BC  ( A  B)( A  C )
Apply

3. Repeat (1) until all resulting sum terms contain all variables in the
domain (either in complemented or non-complemented forms).
 Example (Standard POS)
Convert the following Boolean expressions into standard
POS form:

(A + B + C)(B + C + D)

Solution

1st step: A + B + C = A + B + C + DD
= (A + B + C + D) (A + B + C + D)

2nd step: B + C + D = B + C + D + AA
= (A + B + C + D)(A + B + C + D)

Final answer: Combine answer for 1st and 2nd step

 Boolean Expressions & Truth Tables

Converting SOP to Truth Table

Examine each of the products to determine where the

product is equal to a 1.
Set the remaining row outputs to 0.
 Boolean Expressions & Truth Tables

Converting POS to Truth Table

Opposite process from the SOP expressions.

Each sum term results in a 0.
Set the remaining row outputs to 1.
 Boolean Expressions & Truth Tables

Determining Standard Expressions from Truth Table

INPUT OUTPUT
SOP Expressions
A B C X
0 0 0 0
X = ABC + ABC + ABC +
ABC
0 0 1 0
0 1 0 0
0 1 1 1
POS Expressions
1 0 0 1
1 0 1 0 X = (A + B + C)(A + B + C)
(A + B + C)(A + B + C)
1 1 0 1
1 1 1 1
 Solve this..

 Convert the following SOP expression to an equivalent POS

expression:

f ( A, B, C )  ABC  ABC  ABC  ABC

 Develop a truth table for the expression:

f ( A, B, C )  ( A  B  C )  ( A  B  C )  ( A  B  C )  ( A  B  C )