Digital Logic Design

By: Fahim Shahzad

Complements of functions
Complements using DeMorgan's law
Complements using duality
Standard and Canonical forms
 MinTerms
Consider a system of 3 input signals (variables) x, y, & z.
A term which ANDs all input variables, either in the true or
complement form, is called a minterm.
Thus, the considered 3-input system has 8 minterms, namely:

Each minterm equals 1 at exactly one particular input

combination and is equal to 0 at all other combinations.
Thus, for example, is always equal to 0 except for the input
combination xyz = 000, where it is equal to 1.
The minterm is referred to as m0.
In general, minterms are designated mi, where i corresponds the
input combination at which this minterm is equal to 1.
 MinTerms
For the 3-input system, the number of possible input
combinations is 8 which means that the system has a total
of 8 minterms:
 MaxTerms
Consider a system of 3 input signals (variables) x, y, & z.
A term which ORs all input variables, either in the true or
complement form, is called a maxterm.
Thus, the considered 3-input system has 8 maxterms, namely:

Each maxterm equals 0 at exactly one particular input

combination and is equal to 1 at all other combinations.
For example, (x+y+z) is always equal to 1 except for the input
combination xyz = 000, where it is equal to 0.
The maxterm (x+y+z) is referred to as M0.
In general, maxterms are designated Mi, where i corresponds
the input combination at which this maxterm is equal to 0.
 MaxTerms
For the 3-input system, the number of possible input
combinations is 8 which means that the system has a total
of 8 Maxterms as follows:
Functions as a Sum of Minterms and Product of
Maxterms
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.
Suppose we have two functions and their truth tables are given as:
Functions as a Sum of Minterms and Product of
Maxterms
The function f1 in Table is determined by expressing the
combinations 001, 100, and 111 as x’y’z, xy’z’, and xyz,
respectively.
Since each one of these minterms results in f1 = 1, we have:
f1 = x’y’z + xy’z’ + xyz = m1 + m4 + m7
Similarly:

These examples demonstrate an important property of

Boolean algebra: Any Boolean function can be expressed
as a sum of minterms.
Functions as a Sum of Minterms and Product of
Maxterms
Similarly:

These examples demonstrate a second property of Boolean

algebra: Any Boolean function can be expressed as a
product of maxterms.
Boolean functions expressed as a sum of minterms or
product of maxterms are said to be in canonical form.
Example 1
Example 1
An alternative procedure for deriving the minterms of a
Boolean function is to obtain the truth table of the function
directly from the algebraic expression and then read the
minterms from the truth table.
Example 2
Standard forms
Boolean functions can generally be expressed in the
form of a Sum of Products (SOP) or in the form of a
Product of Sums (POS).
The sum of minterms form is a special case of the SOP
form where all product terms are minterms.
The product of maxterms form is a special case of the
POS form where all sum terms are maxterms.
The SOP and POS forms are Standard forms for
representing Boolean functions.
 Sum of Product expression (SOP)
Any SOP expression can be implemented in 2-levels of
gates.
The first level consists of a number of AND gates which
equals the number of product terms in the expression.
Each AND gate implements one of the product terms in the
expression.
The second level consists of a SINGLE OR gate whose
number of inputs equals the number of product terms in the
expression.
Example (SOP)
Product of Sum (POS)
Any POS expression can be implemented in 2-levels
of gates.
The first level consists of a number of OR gates which
equals the number of sum terms in the expression,
each gate implements one of the sum terms in the
expression.
The second level consists of a SINGLE AND gate
whose number of inputs equals the number of sum
terms.
Standard form
A Boolean function may be expressed in a nonstandard form. For
example, the function
F3 = AB + C(D + E)
is neither in sum‐of‐products nor in product ‐of ‐sums form.
The implementation of this expression is shown and requires two
AND gates and two OR gates.
There are three levels of gating in this circuit.
It can be changed to a standard form by using the distributive law
to remove the parentheses:
F3 = AB + C(D + E) = AB + CD + CE
In general, a two ‐level implementation is preferred because it
produces the least amount of delay through the gates when the
signal propagates from the inputs to the output.
Two level and three level implementation
Thank you.