DIGITAL LOGIC AND DESIGN MODULE 1

MODULE 1
1.1 Number Systems: Binary, Octal, Hexadecimal

1.2 Representation of Negative Numbers – 1’s and 2’s Complements

1.3 Arithmetic Operations

1.4 Binary Codes

1.5 Boolean Algebra – Theorems and Postulates

1.6 Boolean Functions - Truth Table - Canonical and Standard Forms –

Minterms and Maxterms – Sum of Products and Product of Sums

1.7 Logic Gates – Universal gates

1.8 Simplification of Boolean Functions, Karnaugh Map – 2, 3, 4 variables

1.9 NAND/NOR Implementations

1.6 Boolean Function 1

DIGITAL LOGIC AND DESIGN MODULE 1

1.6 Boolean Functions

OUTLINE
• Boolean Function
• Truth Table
• Complement of a Boolean Function
• Minterms and Maxterms
• Representation of Boolean Functions
o SOP
o POS
o Canonical SOP
o Canonical POS
• Writing Boolean Function from truth table
• Conversions - SOP, POS and Canocical Forms

1.6 Boolean Function

DIGITAL LOGIC AND DESIGN MODULE 1

Boolean Function

A Boolean function is a function in mathematics and logic whose

arguments, as well as the function itself, assume values from a
two-element set (usually {0,1}).

Representation of Boolean Functions

• Sum of Product (SOP)

• Product of Sum (POS)

• Canonical Form

– Sum-of-min terms or Canonical SOP

– Product-of- max terms or Canonical POS

1.6 Boolean Function 3

DIGITAL LOGIC AND DESIGN MODULE 1

Sum of Products (SOP)

A SOP form can be formed by adding two or more product terms using a
Boolean addition operation. Eg. F = AB + ABC

Product of Sum (POS)

A POS form can be formed by multiplying two or more sum terms using a
Boolean multiplication operation. Eg. F = (a'+b). (a+b'+c)

Canonical SOP
Each product term contains all literals. So, these product terms are nothing but
the Minterms. Hence, canonical SoP form is also called as Sum of
Minterms(SOM) form. Eg. F = AB’C’ + ABC

Canonical POS
Each sum term contains all literals. So, these sum terms are nothing but the
Maxterms. Hence, canonical PoS form is also called as Product of Max
terms(POM) form. Eg. F = (a'+b+c’). (a+b'+c)

1.6 Boolean Function 4

DIGITAL LOGIC AND DESIGN MODULE 1

Implementation of SOP

• Any SOP expression can be

implemented using 2-levels of
gates

• The 1st level consists of AND

gates, and the 2nd level consists
of a single OR gate

• Also called 2-level Circuit

Introduction to SOP

SOP Minimization

1.6 Boolean Function 5

DIGITAL LOGIC AND DESIGN MODULE 1

Implementation of POS

• Any POS expression can be

implemented using 2-levels of
gates
• The 1st level consists of OR
gates, and the 2nd level consists
of a single AND gate
• Also called 2-level Circuit

Introduction to POS

POS Minimization

1.6 Boolean Function 6

DIGITAL LOGIC AND DESIGN MODULE 1

Minterms and Maxterms

• A logic function has product terms. Product terms that consist of all
the variables of a function are called "canonical product terms“ or
"minterms".
• For example the logic term A.B.C' is a minterm in a three variable
logic function

• Sum terms which contain all the variables of a Boolean function are
called "canonical sum terms", or "maxterms".
• (A+B+C) is an example of a maxterm in a three variable logic
function.

1.6 Boolean Function

DIGITAL LOGIC AND DESIGN MODULE 1

Minterms
• A minterm is a product of all variables taken either in their direct or
complemented form.
• n variables combined with AND operation, 2n combinations.
• if the variable is 0, A‘.
• if the variable is 1, A.

1.6 Boolean Function

DIGITAL LOGIC AND DESIGN MODULE 1

Table of Minterms:

x y z Minterms
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

1.6 Boolean Function

DIGITAL LOGIC AND DESIGN MODULE 1

Maxterms
• A Maxterm is a sum of all variables taken either in
their direct or complemented form.
• n variables combined with OR
• if the variable is 0, A.
• if the variable is 1, A‘.

1.6 Boolean Function

DIGITAL LOGIC AND DESIGN MODULE 1

Table of Maxterms
x y z Maxterms
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

1.6 Boolean Function

DIGITAL LOGIC AND DESIGN MODULE 1

Writing a Boolean function from the Truth Table

(sum of minterms)
Input Output A Boolean function can be expressed
x y z F algebraically from a given truth
0 0 0 1 table by forming a minterm for
0 0 1 0 each combination of the variables
0 1 0 0 that produces a 1 in the function
0 1 1 1 and then taking the OR of all
1 0 0 0 those terms.
1 0 1 1 F = 000+011+101+110
1 1 0 1 F = A’B’C’ + A’BC + AB’C + ABC’
1 1 1 0 F = m 0 + m3+ m5 + m 6
F = Σm(0,3,5,6)
1.6 Boolean Function
DIGITAL LOGIC AND DESIGN MODULE 1

Writing a Boolean function from the Truth Table

(sum of maxterms)

A Boolean function can also be expressed

algebraically from a given truth table by
Input Output F
x y z forming a maxterm for each combination

0 0 0 1 of the variables that produces a 0 in the

0 0 1 0 function and then taking the AND of all
0 1 0 0 those terms.
0 1 1 1 F = (001)(010)(100)(111)
1 0 0 0
F = (A+B+C’)(A+B’+C)(A’+B+C)
1 0 1 1
1 1 0 1 (A’+B’+C’)
1 1 1 0 F = M 1 . M 2 . M4 . M7
F = πM(1,2,4,7)

1.6 Boolean Function

DIGITAL LOGIC AND DESIGN MODULE 1

SOP and POS Examples

Minimal to Canonical form conversion(SOP)
Minimal to Canonical form conversion(POS)

1.6 Boolean Function 14

DIGITAL LOGIC AND DESIGN MODULE 1

1.6 Boolean Function 15

DIGITAL LOGIC AND DESIGN MODULE 1

Test your Knowledge

1. Express the following Boolean expressions in sum of products form:

(b + d)(a’ + b’ + c)

2. Express the following Boolean expression in product of sums form:

a’b + a’c’ + abc

3. Obtain the truth table of the following functions, and express each
function in sum‐of‐minterms and product‐of‐maxterms form:
(b+cd)(c+bd)

4. Express the following function as a sum of minterms and as a product of

maxterms: F(A, B, C, D) = B’D + A’D + BD

5. Express the complement of the following functions in sum‐of‐minterms form:

(a) F(A,B ,C, D) = ∑m(2, 4, 7, 10, 12, 14)
(b) F ( x, y, z ) = ∏M(3, 5, 7)

1.6 Boolean Function 16

DIGITAL LOGIC AND DESIGN MODULE 1

Next Session...

1.7 Logic Gates

1.6 Boolean Function 17