Digital Logic Design

Dr. Muhammad Taha Jilani

Lecture - 4
 Lecture
Last? Today!
 Boolean Analysis • Constructing Truth table from
 Boolean Expressions SOP SOP/POS
and POS • K-Map
 Converting into Standard • Quiz
Form • Assignment 1 (until next week)
 Min- & Max-terms • Project Proposal (this week)
 Extracting SOP/POS from
Truth table

DLD by Dr. Muhammad Taha Jilani 2

 Boolean Algebra and Logic
Simplification
Boolean Expressions & Truth Tables
• All standard Boolean expression can be easily
converted into truth table format using binary
values for each term in the expression.
• Also, standard SOP or POS expression can be
determined from the truth table.

DLD by Dr. Muhammad Taha Jilani 3

 Boolean Algebra and Logic
Simplification
• Converting SOP Expressions to Truth Table Format:
1. The first step in constructing a truth table with possible
combinations of binary values of the variables in the
expression.
2. Convert the SOP expression to standard form if it is not
already.
3. Finally, place a 1 in the output column for each binary
value that makes the standard SOP expression 1, and
place a 0 for all the remaining binary values.

Recall: SOP expression is equal to 1 only if at

least one of the product terms is equal to 1.

DLD by Dr. Muhammad Taha Jilani 4

 Example
Converting SOP Expressions to Truth Table Format:
• Develop a truth table for the standard SOP expression
ABC+ABC+ABC

DLD by Dr. Muhammad Taha Jilani 5

 Exercise?
Develop a truth table for

DLD by Dr. Muhammad Taha Jilani 6

 Exercise?
Develop a truth table for

AC  BC  AD

DLD by Dr. Muhammad Taha Jilani 7

 Boolean Algebra and Logic
Simplification
• Converting POS Expressions to Truth Table Format:
1. The first step in constructing a truth table with possible
combinations of binary values of the variables in the
expression.
2. Convert the POS expression to standard form if it is not
already.
3. Finally, place a 0 in the output column for each binary
value that makes the standard POS expression 0, and
place a 1 for all the remaining binary values.

Recall: POS expression is equal to 0 only if at

least one of the sum terms is equal to 0.

DLD by Dr. Muhammad Taha Jilani 8

 Example
Converting POS Expressions to Truth Table Format:
• Develop a truth table for the standard POS expression

DLD by Dr. Muhammad Taha Jilani 9

 Exercise?
Develop a truth table for

DLD by Dr. Muhammad Taha Jilani 10

 Exercise?
Develop a truth table for
( A  B  C  D )( A  B  C  D )
( A  B  C  D)( A  B  C  D)( A  B  C  D)

DLD by Dr. Muhammad Taha Jilani 11

 Boolean Algebra and Logic
Simplification
• Standard SOP expression from truth table
• Steps:
1. List the binary values of the input variables for which
the output is 1.
2. Convert each binary value to the corresponding product
term by replacing:
• each 1 with the corresponding variable, and
• each 0 with the corresponding variable complement.
• Example: 1010 
AB CD

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• Standard POS expression from truth table
• Steps:
1. List the binary values of the input variables for which
the output is 0.
2. Convert each binary value to the corresponding product
term by replacing:
• each 1 with the corresponding variable complement, and
• each 0 with the corresponding variable.
• Example: 1001 
A  BC  D

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
Determining Standard
• SOP • POS
Expression from a
Truth Table (example) There are four 1s in There are four 0s in
A B C X
the output and the the output and the
corresponding binary corresponding
0 0 0 0
value are 011, 100, binary value are 000,
0 0 1 0
110, and 111. 001, 010, and 101.
0 1 0 0
011  A BC 000  A  B  C
0 1 1 1
100  AB C 001  A  B  C
1 0 0 1
110  ABC 010  A  B  C
1 0 1 0
111  ABC 101  A  B  C
1 1 0 1
1 1 1 1 X  A BC  AB C  ABC  ABC

X Taha
DLD by Dr. Muhammad  B  C )( A  B  C )( A  B
( AJilani  C )( A  B 14
C)
 Exercise?
• Find SOP and POS forms?

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• Do you have some difficulty to apply Boolean
algebra laws, rules, and theorems?
• In 1953, an American mathematician Maurice
Karnaugh introduced a graphical method to simplify
logic expressions. That is known as K-Map
– K-map provides a systematic method with an array of
cells
– It is similar to a truth table, presents all of the possible
values of input variables and the resulting output for each
value.
– Used for simplifying 2, 3, 4 and 5 variable expressions
– It produces, simple SOP & POS expressions

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• K-Map is similar to truth table;
– instead of i/p and o/p into columns and rows, the K-map
is an array of cells in which each cell represents a binary
value of the input variables.
• The cells are arranged in a way so that simplification
of a given expression is simply a matter of properly
grouping the cells.
Two main things to learn:
• Mapping from expression
• Grouping / Minimization of expression

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• K-Map 2 Variable

Based on Union & Intersection

Entire grid is Union of all 4 Cells and simplifies to 1

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• K-Map 2 Variable
Mapping into K-Map

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• K-Map 2 Variable : Example
X  AB  AB
Form? Rules to formed a Group:
• Groups can be formed around “0
or 1” within a cell
• Group contained with “power of
2” i,e, 20=1, 21=2, 22=4, 23=8…
• For group cell must be adjacent
to each other (row, column, square or
rectangular)

Mapping into K-Map • Should be as large as possible,

but few in numbers (as possible)
• Each value must be or atleast in
one group (overlapping)
DLD by Dr. Muhammad Taha Jilani
 Exercise?
• K-Map 2 Variable :
X  AB  AB  AB

DLD by Dr. Muhammad Taha Jilani

 Exercise?
• K-Map 2 Variable :
X  AB  AB  AB

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• K-Map 3 Variable : 23= 8 cells
2 Columns & 4 Rows 4 Columns & 2 Rows
C AB
0 1 00 01 11 10
AB C
00 0
01
1
11
10
DLD by Dr. Muhammad Taha Jilani
 Exercise?
• K-Map 3 Variable :
ABC  AB
ABCC A
ABC  ABC C
0 1
AB
00 1
01 1
11 1
10 1
DLD by Dr. Muhammad Taha Jilani
 Exercise?
• Mapping a Standard SOP Expression:

DLD by Dr. Muhammad Taha Jilani 25

 Exercise?
• Mapping a Standard SOP Expression:

DLD by Dr. Muhammad Taha Jilani 26

 Boolean Algebra and Logic
Simplification
• K-map 4 Variables : 24 = 16 cells
4 Columns & 4 Rows
– K-map is considered to be
wrapped around CD
– All sides are adjacent to each
00 01 11 10
AB
other
– Groups of diagonal cells are
00
not allowed 01
11
10

DLD by Dr. Muhammad Taha Jilani

 Boolean Algebra and Logic
Simplification
• K-map 4 Variables :
– Adjacent cells CD
00 01 11 10
AB
00
01
11
10

DLD by Dr. Muhammad Taha Jilani

 Exercise?
• Mapping a Standard SOP Expression:

DLD by Dr. Muhammad Taha Jilani 29

 Exercise?
• Mapping a Standard SOP Expression:

CD
00 01 11 10
AB
00
01
11
10
DLD by Dr. Muhammad Taha Jilani 30
 Exercise?
• Minimization of SOP Expression – 3 variables
1. Group the cells that have 1s.

DLD by Dr. Muhammad Taha Jilani 31

 Exercise?
• Minimization of SOP Expression – 3 variables

DLD by Dr. Muhammad Taha Jilani 32

 Exercise?
• Minimization of SOP Expression – 4 variables

DLD by Dr. Muhammad Taha Jilani 33

 Boolean Algebra and Logic
Simplification
• Minimization of SOP Expression
2. Minimum product term for each group.
3-Variable Map 4-Variable Map
Cell Group Product Term Cell Group Product Term
1 cell 3-variable 1 cell 4-variable

2 cell 2-variable 2 cell 3-variable

4 cell 1-variable 4 cell 2-variable

8 cell 1-variable

In product term, Keep variables that have same bits (00 or 11)
Discard the variable that have different bits

DLD by Dr. Muhammad Taha Jilani 34

 Boolean Algebra and Logic
Simplification
• Minimization of SOP Expression
2. Minimum product term for each group.
In product term, Keep variables that have same bits (00 or 11)
Discard the variable that have different bits

DLD by Dr. Muhammad Taha Jilani 35

 Boolean Algebra and Logic
Simplification
• Minimization of SOP Expression
2. Minimum product term for each group.
In product term, Keep variables that have same bits (00 or 11)
Discard the variable that have different bits

AC
B
AC D

DLD by Dr. Muhammad Taha Jilani 36

 Boolean Algebra and Logic
Simplification
• Minimization of SOP Expression
3. When all the minimum product terms are
derived from K-map, they summed to get minimum
SOP expression.

f  A C  B  AC D
Observe that,
• Biggest group has the smallest term
• Smallest group has biggest term

DLD by Dr. Muhammad Taha Jilani 37

 Exercise?
• Minimization of SOP Expression – 4 variables
X  A B C D  A BC D  ABC D  AB C D  A BC D  ABC D
AB CD  A B CD  A BCD  ABCD  AB CD

X  BC  AB C  AB C D  D

DLD by Dr. Muhammad Taha Jilani 38

 Exercise?
• Find the
– K-Map
– Minimized SOP & POS Expression

DLD by Dr. Muhammad Taha Jilani 39

 Exercise?
• Find the
– SOP Expression,
Also Implement the
– Draw K-Map Simplified Logic
– Find the Minimized SOP Expression

DLD by Dr. Muhammad Taha Jilani 40

 Quiz

DLD by Dr. Muhammad Taha Jilani 41