04-Logic Simplification CUE

Chapter -4- : Boolean algebra and Logic simplification
Chapter -4-
Chapter -4-
Boolean Algebra and Logic
Simplification
Reference
Digital Fundamentals , 11th edition by Thomas L. Floyd , 2010.
10 January 2020 1
Contents
4-1 Boolean Operations and Expressions

4-2 Laws and Rules of Boolean Algebra
4-3 DeMorgan's Theorems
4-4 Simplification Using Boolean Algebra
4-5 Standard Forms of Boolean Expressions
4-6 Boolean Expressions and Truth Tables
4-7 The Karnaugh Map
4-8 Karnaugh Map SOP Minimization
4-9 Karnaugh Map POS Minimization
10 January 2020 2
1- Boolean Operations & Expressions

Boolean algebra:
• Boolean Algebra is the mathematics of digital systems.
• Variable, complement, and literal are terms used in Boolean algebra.
A variable is a symbol (usually an italic uppercase letter) used to
represent a logical quantity.
• Any single variable can have a 1 or a 0 value.
• The complement is the inverse of a variable and is indicated by a bar
over the variable (over bar). For example,
10 January 2020 3

1-1- Boolean addition :
Boolean addition is equivalent to the OR operation and the basic rules are
illustrated with their relation to the OR gate as follows:
 In Boolean algebra, a sum term is a sum of literals.

 In logic circuits, a sum term is produced by an OR operation with no
AND operations involved . Examples :
10 January 2020 4

1-1 Boolean Addition (cont.) :
10 January 2020 5

1-2 Boolean multiplication
Boolean Multiplication is equivalent to the AND operation and the basic
rules are illustrated with their relation to the AND gate as follows:
 In Boolean algebra, a product term is the product of literals.

 In logic circuits, a product term is produced by an AND operation with
no OR operations involved.
10 January 2020 6

1- 2 Boolean Multiplication (cont.) :
10 January 2020 7
2- Laws & Rules of Boolean Algebra

3-1 Commutative Laws :
For addition A+ B =B +A
For Multiplication AB =BA
10 January 2020 8

3-2 Associative Laws :
For addition A+(B +C )=(A+B)+C
For Multiplication A(BC) =(AB)C
11 January 2020 9
2-3- Distributive Laws :

A( B+C ) =AB +AC
11 January 2020 10
RULE 10: This rule can be proved by applying the distributive law
A + AB = A(1+B)
=A. 1 Rule 2 : (1+B) =1
=A Rule 4 : A . 1 = A
11 January 2020 11
11 January 2020 12
11 January 2020 13
3- DeMorgan’s Theorems
1. The complement of a product of variables is equal to the sum
of the complements of the variables.
2. The complement of a sum of variables is equal to the product

of the complement of the variables.
11 January 2020 14
3- Applying DeMorgan's Theorems

The following procedure illustrates the application of DeMorgan’s theorems
and Boolean algebra to the specific expression
11 January 2020 15
11 January 2020 16
EXAMPLE :
11 January 2020
17
11 January 2020 18
4- Simplification using Boolean Algebra
11 January 2020 19
11 January 2020 20
11 January 2020 21
11 January 2020 22
5- Standard forms of Boolean expression

5-1 The sum of product form (SOP) :
When two or more product terms are summed by Boolean addition. The
resulting expression is a sum-of-products (SOP) .
Example :-
Conversion of a general expression to SOP form :

Any logic expression can be changed to SOP form by applying Boolean
algebra techniques. For example the expression A(B +CD) can be
converted to SOP form by applying the distributive law :
A(B+CD) = AB + ACD
11 January 2020 23

Conversion of a general expression to SOP form :
Step 1: Multiply each nonstandard product term by a term made

up of the sum of a missing variable and its complement. This results
in two product terms .
Step 2: Repeat step -1- until all resulting product term contain all
variables in the domain in either complemented or un-
complemented form .
11 January 2020 24
5- Sum of Products
11 January 2020 25

5-2 The Product of Sums (POS) form :
When two or more sum terms are multiplied. The resulting expression is
a Product Of Sums (POS).
Examples :
Converting a sum term to standard POS :

Step 1 : Add to each nonstandard product term a term made up of the
product of the missing variable and its complement .
Step 2 : Apply rule 12 : A+BC = (A+B)(A+C).
Step 3 :Repeat step -1- until all resulting sum terms contains all variables in
the domain in either complemented or un-complemented form .
11 January 2020 26

Converting a sum term to standard POS
11 January 2020 27
5-3 Converting Standard SOP to Standard POS:

Step 1 :Evaluate each product sum in the SOP expression.
That is determine the binary numbers that represent the
product form.
Step 2 : Determine all of the binary numbers not included in
the evaluation in step 1 .
Step 3 :write the equivalent sum term for each binary
numbers from step and express in pos form.
11 January 2020 28
5-3 Converting Standard SOP to Standard POS (cont.) :
11 January 2020 29
6- Determining standards form truth tables
There are four 1 in the output

column and the
corresponding binary values
are 011,100,110 and 111.
These binary values are
converted to product term as :
11 January 2020 30
6- Determining standards form truth tables
For the POS expression, the output is

0 for binary values 000,001,010 and
101. These binary values are
converted to sum terms as follows:
11 January 2020 31
7- Karnaugh Map
The Karnaugh map provides a systematic method for simplifying
Boolean expressions and if properly used, will produce the simplest
SOP or POS expression possible, known as the minimum expression.
11 January 2020 32
7- Karnaugh Map
Cell Adjacency :
11 January 2020 33
8- Karnaugh Map SOP Minimization
For an SOP expression, a 1 is

placed on the Karnaugh map for
each product term in the
expression. Each 1 is placed in a
cell corresponding to the value
of a product term. So:-
Step 1: Determine the binary
values of each product term in
the SOP expression.
Step2 : as each product term is evaluated, place a 1 on the Karnaugh

map in the cell having the same values as the product sum.
10 January 2020 34

Example :-Map the standard SOP expression on a Karnaugh map
Solution :- The expression is evaluated and a 1 is placed on the 3

variable Karnaugh map.
10 January 2020 35

Example :- Map the following not standard SOP .
Solution:- The SOP is not a standard form because each product

term does not have three variables.
10 January 2020 36
8-1 Karnaugh Map Simplification of SOP

Grouping the 1’s :
I. A group must contain 1,2,3,4,8 or 16 cells.
II. Each cell in a group must be adjacent to one or more cells
in that same group but all cells in the group do not have to
be adjacent to each other.
III. Always include the largest possible number of 1’s in a
group in accordance with rule 1.
IV. Each 1 on the map must be included in at least one group.
The 1s already in a group can be included in other group as
long as the overlapping groups include no common 1s.
10 January 2020 37
8-1 Karnaugh Map Simplification of SOP
10 January 2020 38
8-2 Determining the minimum SOP

expression from the map
1. Group the cells that have 1s. Each group of cells containing 1s
creates one product term composed of all variables that occur
in only one form.
2. Determine the minimum product term for each group
I. A 1-cell group yield’s a 3-varaible product term
II. A 2-cell group yield's a 2-variable product term.
III. A 4-cell group yield's a 1-variable product term.
IV. An 8-cell group yield’s a value of 1 for the expression.
3. When all the minimum product terms are derived from the
Karnaugh map, they are summed from the minimum SOP
expression.
10 January 2020 39

Example :- Determine the product terms for the Karnaugh map and
write the resulting SOP minimum exp.
Solution :-
10 January 2020 40

Example :- Use Karnaugh map to minimize the following
standard SOP Expression .
Solution : The binary values of the expression are
101 + 011 + 011 +000 +100
The result is :-
Example:-
10 January 2020 41
8-3 Mapping directly from truth table
10 January 2020 42
9- Karnaugh Map POS Minimization
Mapping a standard POS Expression :- For a POS expression in

standard form a 0 is placed on the Karnaugh map for each sum term
in the expression. The mapping process can be shown :-
Step1 :- Determine the binary values of each sum term in the
standard POS expression, this is the binary value that makes
the term equal to 0.
Step2 :- As each sum term is evaluated. Place a 0 on the Karnaugh
map in the corresponding cell.
10 January 2020 43
10 January 2020 44

Example :- Use Karnaugh map to minimize the following POS expr.
Solution :-The combinations of binary values of the expression are

(0 + 0 + 0)(0 + 0 + 1)(0 +1 +0)(0 +1 +1)(1 +1 +0)
10 January 2020 45
10 January 2020 46
Five Variable Karnaugh Maps

A Karnaugh map for five variable (ABCDE) can be constructed
using two 4-variable maps. Each map contains 16 cells with the
combinations of variables B,C,D and E. one map is for A=0 and
other is for A=1
10 January 2020 47
Five Variable Karnaugh Maps

The best way to visualize cell adjacencies between the two 16-cell
maps is to imagine that the A=0 map is placed on top of the A=1 map.
Each cell in the A=0 map is adjacent to the cell directly below it in
the A=1 map.
The 1s in the yellow cells form an 8-
bit group( four in the A=0 map
combined with four in the A=1 map).
The 1s in the orange cells form a 4-
bit group. The 1s in the light red cells
form a 4-bit group only in the A=0
map. The 1 in the gray cell in the A=1
map is grouped with the 1 in the
lower right light red cell in the A=0
map to form a 2-bit group
10 January 2020 48
10 January 2020 49

04-Logic Simplification CUE

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

04-Logic Simplification CUE

Загружено:

Авторское право:

Доступные форматы

Chapter -4- : Boolean algebra and Logic simplification

4-1 Boolean Operations and Expressions

1- Boolean Operations & Expressions

1- Boolean Operations & Expressions

 In Boolean algebra, a sum term is a sum of literals.

1- Boolean Operations & Expressions

1- Boolean Operations & Expressions

 In Boolean algebra, a product term is the product of literals.

1- Boolean Operations & Expressions

2- Laws & Rules of Boolean Algebra

For Multiplication AB =BA

2- Laws & Rules of Boolean Algebra

For Multiplication A(BC) =(AB)C

2- Laws & Rules of Boolean Algebra

2-3- Distributive Laws :

2- Laws & Rules of Boolean Algebra

2- Laws & Rules of Boolean Algebra

2- Laws & Rules of Boolean Algebra

2. The complement of a sum of variables is equal to the product

3- Applying DeMorgan's Theorems

3- Applying DeMorgan's Theorems

3- Applying DeMorgan's Theorems

4- Simplification using Boolean Algebra

4- Simplification using Boolean Algebra

4- Simplification using Boolean Algebra

4- Simplification using Boolean Algebra

5- Standard forms of Boolean expression

Conversion of a general expression to SOP form :

5- Standard forms of Boolean expression

Step 1: Multiply each nonstandard product term by a term made

5- Standard forms of Boolean expression

Converting a sum term to standard POS :

5- Standard forms of Boolean expression

5- Standard forms of Boolean expression

5-3 Converting Standard SOP to Standard POS:

5- Standard forms of Boolean expression

5-3 Converting Standard SOP to Standard POS (cont.) :

6- Determining standards form truth tables

There are four 1 in the output

6- Determining standards form truth tables

For the POS expression, the output is

8- Karnaugh Map SOP Minimization

For an SOP expression, a 1 is

Step2 : as each product term is evaluated, place a 1 on the Karnaugh

8- Karnaugh Map SOP Minimization

Solution :- The expression is evaluated and a 1 is placed on the 3

8- Karnaugh Map SOP Minimization

Solution:- The SOP is not a standard form because each product

8-1 Karnaugh Map Simplification of SOP

8-1 Karnaugh Map Simplification of SOP

8-2 Determining the minimum SOP

8-2 Determining the minimum SOP

8-2 Determining the minimum SOP

8-3 Mapping directly from truth table

9- Karnaugh Map POS Minimization

Mapping a standard POS Expression :- For a POS expression in

9- Karnaugh Map POS Minimization

9- Karnaugh Map POS Minimization

Solution :-The combinations of binary values of the expression are

Five Variable Karnaugh Maps

Five Variable Karnaugh Maps

Вам также может понравиться