Example:
Fill in the Karnaugh map for the Boolean expression below, then write the
Boolean expression for the result.
Solution:
The Boolean expression has three product terms. There will be a 1 entered
for each product term. Though, in general, the number of 1s per product
term varies with the number of variables in the product term compared to
the size of the K-map.
The product term is the address of the cell where the 1 is entered. The first
product term, A’B, corresponds to the 01 cell in the map. A 1 is entered in
this cell. The other two P-terms are entered for a total of three 1s
Next, proceed with grouping and extracting the simplified result as in the
previous truth table problem.
Example:
Simplify the logic diagram below.
Solution: (Figure below)
Write the Boolean expression for the original logic diagram as shown
below
Transfer the product terms to the Karnaugh map
Form groups of cells as in previous examples
Write Boolean expression for groups as in previous examples
Draw simplified logic diagram
Example: Simplify the logic diagram below.
Solution:
Write the Boolean expression for the original logic diagram shown
above
Transfer the product terms to the Karnaugh map.
It is not possible to form groups.
No simplification is possible; leave it as it is.
No logic simplification is possible for the above diagram. This sometimes
happens. Neither the methods of Karnaugh maps nor Boolean algebra can
simplify this logic further.
We show an Exclusive-OR schematic symbol above; however, this is not a
logical simplification. It just makes a schematic diagram look nicer.
Since it is not possible to simplify the Exclusive-OR logic and it is widely
used, it is provided by manufacturers as a basic integrated circuit (7486).
