Scribd
Upload
32 views

C16 Canonical Forms

The document discusses Boolean algebra and gate networks. It provides examples of truth tables and converting expressions between sum of products and product of sums form. Standard forms and mapping expressions to Karnaugh maps are also covered.

Uploaded by

yadhucr5577
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
32 views

C16 Canonical Forms

The document discusses Boolean algebra and gate networks. It provides examples of truth tables and converting expressions between sum of products and product of sums form. Standard forms and mapping expressions to Karnaugh maps are also covered.

Uploaded by

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

Unit 4

Boolean Algebra &


Gate Networks

CANONICAL EXPRESSIONS
 Develop a truth Inputs Output Product
table for the A B C X Term
standard SOP 0 0 0 0
expression 0 0 1 1 ABC
0 1 0 0
A B C + AB C + ABC 0 1 1 0
1 0 0 1 AB C
1 0 1 0
1 1 0 0
1 1 1 1 ABC
 Truth Table to Boolean Function

A B C F F = ABC + ABC + ABC + ABC


0 0 0 0
0 0 1 1
0 1 0 0
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
 Develop a truth Inputs Output Product
table for the A B C X Term
standard SOP 0 0 0 0 ( A + B + C)
expression 0 0 1 1
0 1 0 0 ( A + B + C)
( A + B + C )( A + B + C )( A + B + C ) (A+ B + C )
0 1 1 0
( A + B + C )( A + B + C )
1 0 0 1
1 0 1 0 (A + B + C )
1 1 0 0 ( A + B + C)
1 1 1 1
I/P O/P  There are four ◼ There are four 0s in
1s in the output the output and the

SOP POS
A B C X
and the corresponding
0 0 0 0 corresponding binary value are 000,
0 0 1 0 binary value are 001, 010, and 101.
0 1 0 0 011, 100, 110,
011 → A BC 000 → A + B + C
0 1 1 1 and 111.
100 → AB C 001 → A + B + C
1 0 0 1 110 → ABC 010 → A + B + C
1 0 1 0 111 → ABC 101 → A + B + C

1 1 0 1
X = A BC + AB C + ABC + ABC
1 1 1 1
X = ( A + B + C )( A + B + C )( A + B + C )( A + B + C )
 Sum of Minterms A B C F F
F = ABC + ABC + ABC + ABC 0 0 0 0 0 1
1 0 0 1 1 0
F = m1 + m4 + m5 + m7
2 0 1 0 0 1
 Product
F 1,Maxterms
=  (of 4,5,7)
3 0 1 1 0 1
4 1 0 0 1 0
F = ABC + ABC + ABC + ABC 5 1 0 1 1 0
F = ABC + ABC + ABC + ABC 6 1 1 0 0 1
7 1 1 1 1 0
F = ABC • ABC • ABC • ABC
F = ( A + B + C )( A + B + C )( A + B + C )( A + B + C )
F = M0 M2 M3 M6
F =  (0,2,3,6)
 A Boolean expression must be in standard
form before you use a K-map.
◦ If one is not in standard form, it must be converted.
 You may use the procedure mentioned earlier
or use numerical expansion.
Mapping a Nonstandard SOP
Expression
◼ Numerical Expansion of a Nonstandard product term
◼ Assume that one of the product terms in a certain 3-variable
SOP expression is AB .
◼ It can be expanded numerically to standard form as follows:
◼ Step 1: Write the binary value of the two variables and attach a 0 for
the missing variable C : 100.
◼ Step 2: Write the binary value of the two variables and attach a 1 for
the missing variable C : 100.
◼ The two resulting binary numbers are the values of the
standard SOP terms → AB C and AB C .
◼ If the assumption that one of the product term in a 3-
variable expression is B. How can we do this?
Converting Non-Standard SOP
(example)
◼ Convert the following Boolean expression into
standard SOP form:
AB C + A B + ABC D

AB C = AB C ( D + D ) = AB CD + AB CD

A B = A B (C + C ) = A B C + A B C
A B C ( D + D ) + A B C ( D + D ) = A B CD + A B CD + A B C D + A B C D

AB C + A B + ABC D = AB CD + AB CD + A B CD + A B CD + A B C D + A B C D + ABC D

8
 Map the following SOP expressions on K-
maps:
A + AB + ABC
BC + A C
B C + AB + ABC + AB CD + A B C D + AB CD
A + C D + ACD + A BCD
The Standard POS Form
◼ A standard POS expression is one in which all the
variables in the domain appear in each sum term in
the expression.
◼ Example: ( A + B + C + D )( A + B + C + D)( A + B + C + D)

◼ Standard POS expressions are important in:


◼ Constructing truth tables
◼ The Karnaugh map simplification method
Converting a Sum Term to Standard
POS
◼ Step 1: Add to each nonstandard product term a
term made up of the product of the missing
variable and its complement. This results in two
sum terms.
◼ As you know, you can add 0 to anything without
changing its value.
◼ Step 2: Apply rule 12 → A+BC=(A+B)(A+C).
◼ Step 3: Repeat step 1 until all resulting sum
terms contain all variable in the domain in either
complemented or uncomplemented form.
Converting a Sum Term to Standard
POS (example)
◼ Convert the following Boolean expression into
standard POS form:
( A + B + C )( B + C + D )( A + B + C + D)

A + B + C = A + B + C + DD = ( A + B + C + D)( A + B + C + D )

B + C + D = B + C + D + AA = ( A + B + C + D )( A + B + C + D )

( A + B + C )( B + C + D )( A + B + C + D) =
( A + B + C + D)( A + B + C + D )( A + B + C + D )( A + B + C + D )( A + B + C + D)

You might also like