Department of Computer Science and Engineering

Daffodil International University

Standard Forms or Canonical Forms Conversions of Boolean Functions

Course Title: Digital Logic Design

Course Code: CSE 223

Prepared By:
Bakhtiar Muiz
Lecturer, Dept. of CSE, DIU

CSE223@DIU, SPRING 2025 1

 Department of Computer Science and Engineering
Daffodil International University
Duality

Duality Principle: The duality principle states that every algebraic

expression in Boolean algebra remains valid if we swap the AND and
OR operators and interchange 0 and 1.
Example:
❑ Given expression: A⋅(B+C)=A⋅B+A.C
❑ Dual expression: A+(B⋅C)=(A+B)⋅(A+C)

CSE223@DIU, SPRING 2025 2

 Department of Computer Science and Engineering
Daffodil International University
Duality

CSE223@DIU, SPRING 2025 3

 Department of Computer Science and Engineering
Daffodil International University
Boolean Function vs Expression

A Boolean function defines the relationship and output for all input
combinations, while a Boolean expression is a specific form or
representation of that function. The function encompasses the
overall logic, and the expression is a way to articulate it.

❑Boolean Function: F(A,B,C)

❑Boolean Expression: A⋅B+A′⋅C

CSE223@DIU, SPRING 2025 4

 Department of Computer Science and Engineering
Daffodil International University
What are Canonical Forms?

❑Canonical forms are standardizedrepresentations of Boolean functions.

Canonical Form – In Boolean algebra, the Boolean function can be expressed as
Canonical Disjunctive Normal Form known as minterm and some are expressed as
Canonical Conjunctive Normal Form known as maxterm.

Two primary canonical forms: Sum of Products (SOP) and Product of Sums (POS).

In Minterm, we look for the functions where the output results in “1” while in
Maxterm we look for functions where the output results in “0”.
These forms help in simplifying and analyzing Boolean expressions systematically.

CSE223@DIU, SPRING 2025 5

 Department of Computer Science and Engineering
Daffodil International University
What are Standard Forms?

A standard form is a simplified or organized representation of a Boolean function. It

follows certain rules but doesn't necessarily list all minterms or maxterms explicitly
like the canonical form does.

❑Standard forms are more concise and often used for practical circuit design.
❑They are simplified versions of canonical forms that are easier to work with in terms
of implementation.
❑These forms can still be derived from the truth table but don’t require every
minterm or maxterm to be explicitly listed.

CSE223@DIU, SPRING 2025 6

 Department of Computer Science and Engineering
Daffodil International University
Canonical form & Standard Form
Canonical Form: Standard Form:
⮚ Sum of Products (SOP) ⮚ Sum of Products (SOP)
Example: 𝐹(𝐴,𝐵,𝐶)=𝐴′𝐵𝐶+𝐴𝐵′𝐶′+𝐴𝐵𝐶 Example: F(A,B,C)=A⋅B+A′⋅C
Explanation: Includes all the Explanation: A simplified form of SOP
minterms where the function is true.
expression, not necessarily including all
⮚ Product of Sums (POS) minterms.
Example: ⮚ Product of Sums (POS)
𝐹(𝐴,𝐵,𝐶)=(𝐴+𝐵+𝐶′)(𝐴′+𝐵+𝐶)(𝐴′+𝐵′+𝐶)
Example: F(A,B,C)=(A+B)⋅(B+C)
Explanation: Includes all the
maxterms where the function is false. Explanation: A simplified form of POS
expression, not necessarily including all
maxterms.
CSE223@DIU, SPRING 2025 7
 Department of Computer Science and Engineering
Daffodil International University
Minterm

A minterm is a product (AND operation) of all the variables in the function, each
in true or complemented form. It represents a unique combination of variable
states where the function is true.

Example:
For a 3-variable function F(A,B,C), the minterm A′BC corresponds to the
combination where A=0, B=1, and C=1.

Minterms: A′B′C′, A′B′C, A′BC, AB′C, ABC′, ABC

CSE223@DIU, SPRING 2025 8

 Department of Computer Science and Engineering
Daffodil International University
Maxterm

A maxterm is a sum (OR operation) of all the variables in the function, each in
true or complemented form. It represents a unique combination of variable states
where the function is false.

Example:
For a 3-variable function F(A,B,C), the maxterm (A+B′+C) corresponds to the
combination where A=0, B=1, and C=0.

Mixterms: (A+B+C), (A+B+C′), (A+B′+C), (A+B′+C′), (A′+B+C), (A′+B+C)

CSE223@DIU, SPRING 2025 9

 Department of Computer Science and Engineering
Daffodil International University
Truth table representing minterm and maxterm

CSE223@DIU, SPRING 2025 10

 Department of Computer Science and Engineering
Daffodil International University
Truth table representing minterm and maxterm
From the above table it is clear that minterm is expressed in product format and maxterm is
expressed in sum format.

❑Sum of minterms –
The minterms whose sum defines the Boolean function are those which give the 1’s of the
function in a truth table. Since the function can be either 1 or 0 for each minterm, and since
there are 2^n minterms, one can calculate all the functions that can be formed with n
variables to be (2^(2^n)). It is sometimes convenient to express a Boolean function in its sum
of minterm form.

❑Product of maxterms –
When dealing with Boolean algebra, the product of maxterms is a handy way to
express how combinations of inputs lead to a result of 0. Maxterms basically tell us which
combinations of inputs won’t give us a 1 as an output. They are the opposite of minterms,
which tell us when we get a 1.

CSE223@DIU, SPRING 2025 11

 Department of Computer Science and Engineering
Daffodil International University
Canonical Form conversion approach
There are two approaches to convert an expression into canonical form. They are-

1. Using truth table

2. Using Boolean Algebra

CSE223@DIU, SPRING 2025 12

 Department of Computer Science and Engineering
Daffodil International University
Example
❑ Example – Express the Boolean function F = A + B’C as standard sum of minterms.

Standard Sum of Minterms: F=A′B′C+AB′C′+AB′C+ABC′+ABC.

This table shows the output of F for all possible combinations of A, B, and C, and identifies
which minterms make the function true.
CSE223@DIU, SPRING 2025 13
 Department of Computer Science and Engineering
Daffodil International University
Example
❑ Example – Express the Boolean function F = A + B’C as standard sum of minterms.
• Solution –
A = A(B + B’) = AB + AB’
This function is still missing one variable, so
A = AB(C + C’) + AB'(C + C’) = ABC + ABC’+ AB’C + AB’C’
The second term B’C is missing one variable; hence,
B’C = B’C(A + A’) = AB’C + A’B’C
Combining all terms, we have
F = A + B’C = ABC + ABC’ + AB’C + AB’C’ + AB’C + A’B’C
But AB’C appears twice, and
according to theorem 1 (x + x = x), it is possible to remove one of those
occurrences. Rearranging the minterms in ascending order, we finally
obtain
F = A’B’C + AB’C’ + AB’C + ABC’ + ABC
= m1 + m4 + m5 + m6 + m7
SOP is represented as Sigma(1, 4, 5, 6, 7)

CSE223@DIU, SPRING 2025 14

 Department of Computer Science and Engineering
Daffodil International University
Self Practice

❑ Example – Express the Boolean function F = xy + x’z as a minterm & maxterms

CSE223@DIU, SPRING 2025 15

 Department of Computer Science and Engineering
Daffodil International University
Advantange & Disadvantage
Advantages of Canonical Form:
Uniqueness: The canonical form of a boolean function is unique, which means that there is only
one possible canonical form for a given function.
Clarity: The canonical form of a boolean function provides a clear and unambiguous
representation of the function.
Completeness: The canonical form of a boolean function can represent any possible boolean
function, regardless of its complexity.
Disadvantages of Canonical Form:
Complexity: The canonical form of a boolean function can be complex, especially for functions
with many variables.
Computation: Computing the canonical form of a boolean function can be computationally
expensive, especially for large functions.
Redundancy: The canonical form of a boolean function can be redundant, which means that it can
contain unnecessary terms or variables that do not affect the function.
CSE223@DIU, SPRING 2025 16
Department of Computer Science and Engineering
Daffodil International University

Thank you for hearing with

patience

CSE233@DIU, SPRING 2025 17