Scribd
Upload
125 views

Standard Form

The document discusses canonical and standard form in Boolean algebra. It defines canonical form as a Boolean function expressed in canonical disjunctive normal form (CDNF) known as minterms or canonical conjunctive normal form (CCNF) known as maxterms. Standard form requires all variables be in true or complemented form. Minterms represent the combinations of variables that result in an output of 1, while maxterms represent combinations that result in an output of 0. Boolean functions can be expressed as the sum of minterms or product of maxterms, known as canonical form. Examples are provided to convert Boolean functions to their standard sum of minterms or product of maxterms canonical form.

Uploaded by

Raktim Mondal 15-4287
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
125 views

Standard Form

The document discusses canonical and standard form in Boolean algebra. It defines canonical form as a Boolean function expressed in canonical disjunctive normal form (CDNF) known as minterms or canonical conjunctive normal form (CCNF) known as maxterms. Standard form requires all variables be in true or complemented form. Minterms represent the combinations of variables that result in an output of 1, while maxterms represent combinations that result in an output of 0. Boolean functions can be expressed as the sum of minterms or product of maxterms, known as canonical form. Examples are provided to convert Boolean functions to their standard sum of minterms or product of maxterms canonical form.

Uploaded by

Raktim Mondal 15-4287
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 7

Canonical and Standard

Form
• Canonical Form – 
In Boolean algebra,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 .
In Minterm, we look for the functions where the output results in “1” while
in Maxterm we look for function where the output results in “0”.
We perform Sum of minterm also known as Sum of products (SOP) .
We perform Product of Maxterm also known as Product of sum (POS).
Boolean functions expressed as a sum of minterms or product of maxterms
are said to be in canonical form.
• Standard Form – 
A Boolean variable can be expressed in either true form or
complemented form. In standard form Boolean function will contain all
the variables in either true form or complemented form while in
canonical number of variables depends on the output of SOP or POS.
Truth table representing minterm and
maxterm –
Sum of minterms –
• From the above table it is clear that minterm is expressed in product
format and maxterm is expressed in sum format.

• 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.
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)
Example – Express the Boolean function F = xy + x’z as
a product of maxterms
• Solution –
F = xy + x’z
= (xy + x’)(xy + z)
= (x + x’)(y + x’)(x + z)(y + z)
= (x’ + y)(x + z)(y + z)
x’ + y = x’ + y + zz’
= (x’+ y + z)(x’ + y + z’) x + z
= x + z + yy’
= (x + y + z)(x + y’ + z) y + z
= y + z + xx’
= (x + y + z)(x’ + y + z)
F = (x + y + z)(x + y’ + z)(x’ + y + z)(x’ + y + z’)
= M0*M2*M4*M5
POS is represented as Pi(0, 2, 4, 5)
Thank You

You might also like