DIGITAL COMBINATIONAL CIRCUITS

ETT04201

<Logic Expressions & Boolean Algebra>

1 www.atc.ac.tz David M.
 Lecture Content
Introduction
SOP and POS
Standard Forms
Minterms and Maxterms
Canonical Forms

2 www.atc.ac.tz David M.
 Introduction
• Logical functions are generally expressed
in terms of logical variables. Values
taken on by the logical functions and
logical variables are in the binary form.
• An arbitrary logic function can be
expressed in the following forms:

1. Sum of Products(SOP)

2. Product of Sums (POS).

3 www.atc.ac.tz David M.
 Introduction
• Product term: The AND function is referred to as
a product. The logical product of several
variables on which a function depends is
considered to be a product term. The variables in
a product term can appear either in
complemented or un–complemented form. ABC’
for example, is a product term.

• Sum term: An OR function is referred to as a

sum. The logical sum of several variables on
which a function depends is considered to be a
sum term. The variables in a sum term can appear
either in complemented or un-complemented
form. A+B+C’ for examples, is a product term.

4 www.atc.ac.tz David M.
 Sum of product &
Product of sum
• Sum of Products (SOP): The logical sum of two or
more logical product terms, is called a sum of
products expression. It is basically an OR operation
of AND operated variables such as:
1) Y= AB + BC +AC
2) Y = AB +A’C +BCD

• Product of Sum (POS):The logical product of two

or more logical sum terms, is called a product of
sums expression. It is basically an AND operation of
OR operated variables such as:
1) Y= (A +B)(B +C)(A + C)
2) Y = (A +B + C) (A’ +C)

5 www.atc.ac.tz David M.
 The standard SOP and
POS Form
• A standard SOP expression is defined as an
expression in which all the variables in the
domain appear in each product term in
complimented on non complimented.

• A non-standard SOP expression can be converted

into standard form using the following Boolean
algebra law: A +A' = 1 . Here is the procedure:
1. Multiply each non – standard product term
by a term made up of the sum of a missing
variable and its complement. This results in
two product terms.
2. Repeat step 1 until all resulting product
terms contain all variables in the domain in
either complemented or un – complemented
6 form. www.atc.ac.tz David M.
 The standard SOP and
POS Form
• A standard POS expression is defined as an expression
in which all the variables in the domain appear in each
sum term.
• A non – standard POS expression can be converted into
standard form using the following Boolean algebra law:
A. A’ = O. Here is the procedure:
1. Add to each non – standard product term
a term made up of the product of a
missing variable and its complement.
2. Apply the distributive properly A+BC=
(A+B)(A+C)

3. Repeat step 1 until all resulting sum terms

contain all variables in the domain in
either complemented or un –
complemented form.
7 www.atc.ac.tz David M.
 Examples
 Convert the following expressions
into their standard SOP form
1. AC+ABC
2. A`BC +AC’D +AB’CD
 Convert the following expressions
into their standard POS form:
1. (A +B)(A+B+C)
2. (A’ +B + C )(A +C’ + D)(A +B’ + C + D )

8 www.atc.ac.tz David M.
 The std. Form of SOP &
POS
These standard forms are important
in:

 Constructing Truth Tables: And

 Karnaugh Map simplification method.

9 www.atc.ac.tz David M.
 Minterms and
Maxterms
The standard product terms are called “minterms”.

The main property of a minterm is that it possesses

the value 1 for only one combination of N input
variables i.e. for a N variable function of the
2Nminterms, only one minterm will have the value
1.

Given a truth table, SOP expression for the Boolean

function represented by that table can be derived by
summing the minterms that correspond to the
combinations containing a function value 1.

10 www.atc.ac.tz David M.
 Minterms and
Maxterms
• The standard sum terms are called “maxterms”.

• The main property of a maxterm is that it

passesses the value o for only one combination
of K input variables i.e for K variable function of
the 2Kmaxterms, only one maxterm will have
the value o.

• Given a truth table, POS expression for the

Boolean function represented by that table can
be derived by ANDing the maxterms that
correspond to the combinations containing a
fuction value 0.
www.atc.ac.tz 11 David M.
 Examples
• Derive the SOP and POS expressions from the
following truth table.
INPUTS OUTPUT
A B C F
0 0 0 0
0 0 1 0
0 1 0 1
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 0
1 1 1 1

• NOTE: The POS expression for a Boolean

function can also be obtained from its SOP
12 www.atc.ac.tz David M.
expression using F” = F
 Canonical Form
• Canonical SOP Expression

• It is defined as the logical sum of all the

minterms derived from the rows of truth
table, for which the value of the function is
1.it is also called a minterm canonical form.

• In its compact form, the canonical SOP

expression is given by listing the decimal
codes in correspondence with the minterm
containing a function value of 1.
13 www.atc.ac.tz David M.
 Canonical Form
Canonical SOP Expression
For example, if the canonical sum of product form of
a 3-Variable logic function Y has three minterms
A’B’C’, AB’C ,ABC’ , This can be expressed as the
sum of decimal codes corresponding to these
minterms below;
F= Ʃm(0,5,6)
=m0+m5+m6
=A’B’C’+AB’C+ABC’
Where Ʃm(0,5,6) represents the summation of
minterms corresponding to decimal codes 0, 5, and 6.

14 www.atc.ac.tz David M.
 Canonical form
• Canonical POS Expression
• It is defined as the logical product of all the
maxterms derived from the rows of a truth
table, for which the value of the function is 0
it is also called a maxterm canonical form.
• In its compact form, the canonical POS
expression is given by listing the decimal
codes in correspondence with the maxterm
containing a function value of 0.

15 www.atc.ac.tz David M.
 Canonical form
• Canonical POS Expression
• For example, if the canonical product of sum form of
a 3- variable logic function F has four maxterms (A +
B + C), (A + B’+ C) ,(A’+B+C)and (A’ +B’ +C’), this
can be expressed as the product of the decimal
codes corresponding to these maxterms as below:
F = ᴨ(0,2,4,7)
= M0.M2.M4.M7
=(A+B+C)(A+B’+C)(A’ + B + C)(A’ + B’
+ C’)
• Where ᴨ(0,2,4,7) represents the product of
maxterms corresponding to the decimal codes 0,2,4,
and7
16 www.atc.ac.tz David M.
 THE END

ANY QUESTION ???

17 www.atc.ac.tz David M.
 DIGITAL COMBINATIONAL CIRCUITS
ETT04201

<KARNAUGH MAP>

18 www.atc.ac.tz David M.
 Lecture Content
Introduction
Representing Boolean Functions on the K-
Map
Simplification of Boolean Functions using K-
Map.

19 www.atc.ac.tz David M.
 Introduction
 Using Boolean Algebra for minimization causes it’s
own problem because of it mainly being a trail and
error process and we can almost never be sure that
we have reached a minimal representation.
 The simplification of the switching function using
Boolean laws and theorems become very complex
with the increase in the number of variables and
terms. The procedure is awkward as it lacks specific
rules to predict each succeeding step in the
manipulative process.
 The Karnaugh Map Technique provides a simple
systematic and straightforward method for
simplifying and manipulating Boolean Function. This
method is regarded as Pictorial form of truth table
i.e the information containing is a truth table or
available in the POS or SOP form is represented on
the K-Map.
20 www.atc.ac.tz David M.
 What is K-Map??
K-map is a diagram made up of squares called
cells. Each cell corresponds to one combination
of n-variables. Therefore for each row of the
truth table i.e for each minterm and for each
maxterm, there is a specific cell on the K-map.
In an n-variable K-map, there are 2^n cells.
The followings are the maps for 2,3 and 4
variables.
K-map cells are arranged such that adjacent
m0 mcells m0 m1 m3 m2
1 correspond
m0 m1 mto 3
to
m2truth rows that differ in
m4 m5 m7 m6
m2 monly
3 ONE
m4 bitmposition
5 m7 m6
m1 m1 m1 m1
2 3 5 4
21 www.atc.ac.tz m8 m9 m1 m1 David M.
1 0
 Representation of Boolean
Functions
Boolean Expression are represented on the K-
map as follows:
1. Write the terms(product terms) into their
standard form (minterms).
2. Draw the K-Map of n-variables with reference to
the number of variable in the function domain.
3. Identify the minterms that belong to to the given
function on the K-map
4. Replace each minterms with 1
Examples;
1. F=AB
2. F= Ʃm(0,5,6)
3. F= A+BC

22 www.atc.ac.tz David M.
 Simplification Of Boolean
Functions
Simplification of Boolean Functions using K-
map, is based on the principle of combining
the terms present in the adjacent cells.
The 1s in the adjacent cells can be grouped
by drawing a loop around those cells.
The following are the governing rules;

23 www.atc.ac.tz David M.
 Simplification of Boolean
Expression
 Governing rules
1. Examine the map for 1s that can not be combined with
other 1 cells and form group with such single 1.
2. Next look for those 1s which are adjacent to only one
other 1 and form groups containing only 2 cells and
which are not part of any group of 4 or 8. A group of 2
cells is called PAIR.
3. Group the 1s which results in group of 4 cells group but
are not part of 8 cells group. A group of 4 cells is called
QUAD.
4. Group the 1s which results in group of 8 cells. A group of
8 cells is called OCTET.
5. Form more Pairs,Quads and Octets to include those 1s
that have not yet been grouped and use only minimum
number of groups. There can be overlapping of groups if
the include common 1s.
6. Omit any redundant group.
7. Form the logical sum of all terms generated by each
group.
24 www.atc.ac.tz David M.
 Example of grouping pairs

25 www.atc.ac.tz David M.
 Examples of grouping QUADS

26 www.atc.ac.tz David M.
 Examples of grouping the
OCTETS
1 1
1 1 1 1 1 1

1 1 1 1 1 1

1 1

1 1 1 1 1 1

1 1

1 1
1 1 1 1 1 1

27 www.atc.ac.tz David M.
 Simplification of Boolean
Functions
When one or more than one variables
appear in both complimented and un-
complimented form within a group, then
that variable is eliminated from the term
corresponding to that group.
The variables that are the same for all the
cells of the group must appear in the term
corresponding to that group.

28 www.atc.ac.tz David M.
 Examples
Simplify the Following Boolean functions
using K-Map method:
1. F=A’BC+A’BC’+AB’C’+AB’C
2. F=A’BC+AB’C+ABC+ABC’
3. F=A’C+A’B+AB’C+BC
4. F=Ʃm(0,2,4,5,6)
5. F=Ʃm(1,3,5,7,9,12,13)
6. F=Ʃm(8,10,11,12,13,14,15)
7. F=Ʃm(0,1,2,4,5,6,8,9,12,13,14)
8. F=A’B’C’+B’CD’+A’BCD’+AB’C’
9. F=BC’D’+A’BC’D+ABC’D+A’BCD+ABCD

29 www.atc.ac.tz David M.