Scribd
Upload
61 views13 pages

Simplifying Logic with Karnaugh Maps

A Karnaugh map is a graphical method used to simplify logic expressions into their most simplified sum-of-products or product-of-sums form. It displays the variables along the edges and truth table outputs within the cells. Adjacent cells containing ones can be grouped according to rules such as only horizontal or vertical groups of 1, 2, 4, or 8 cells that contain no zeros and result in as few groups as possible. Karnaugh maps are commonly used to simplify problems with 2, 3, or 4 variables.

Uploaded by

Cresia Mae
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
61 views13 pages

Simplifying Logic with Karnaugh Maps

A Karnaugh map is a graphical method used to simplify logic expressions into their most simplified sum-of-products or product-of-sums form. It displays the variables along the edges and truth table outputs within the cells. Adjacent cells containing ones can be grouped according to rules such as only horizontal or vertical groups of 1, 2, 4, or 8 cells that contain no zeros and result in as few groups as possible. Karnaugh maps are commonly used to simplify problems with 2, 3, or 4 variables.

Uploaded by

Cresia Mae
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

Karnaugh Map (K-MAP)

Digital Logic and Switching Theory

A Karnaugh map is a graphical method used to obtained the


most simplified form of an expression in a standard form
(Sum-of-Products or Product-of-Sums).
• The diagram below illustrates the correspondence between the
Karnaugh map and the truth table for the general case of a two-
variable problem.
Karnaugh Map (K-MAP)
Digital Logic and Switching Theory

The values inside the squares are copied from the output
column of the truth table, therefore there is one square in
the map for every row in the truth table. Around the edge of
the Karnaugh map are the values of the two input variable. A
is along the top and B is down the left hand side. The diagram
below explains this:
Karnaugh Map (K-MAP)
Digital Logic and Switching Theory

Karnaugh maps, or K-maps, are often used to simplify logic


problems with 2, 3 or 4 variables. Example table for 3
variables:

F
Karnaugh Map (K-MAP)
Digital Logic and Switching Theory

Example table for 4 variables:

F
Truth Table notation for Minterms and
Maxterms
Digital Logic and Switching Theory

A B C Minterm Maxterm
0 0 0 A’B’C’ = m0 A+B+C = M0
0 0 1 A’B’C = m1 A+B+C’ = M1
0 1 0 A’BC’ = m2 A+B’+C = M2
0 1 1 A’BC = m3 A+B’+C’ = M3
1 0 0 AB’C’ = m4 A’+B+C = M4
1 0 1 AB’C = m5 A’+B+C’ = M5
1 1 0 ABC’ = m6 A’+B’+C = M6
1 1 1 ABC = m7 A’+B’+C’ = M7
Rules of Simplification
Digital Logic and Switching Theory

The Karnaugh map uses the following rules for the


simplification of expressions by grouping together
adjacent cells containing ones (SOP) or zero (POS).
• Groups may not include any cell containing a zero for SOP
and one for POS
Rules of Simplification (Cont.)
Digital Logic and Switching Theory

• Groups may be horizontal or vertical, but not diagonal.


Rules of Simplification (Cont.)
Digital Logic and Switching Theory

• Groups must contain 1, 2, 4, 8, or in general 2n cells.


▪ That is if n = 1, a group will contain two 1's since 21 = 2.
▪ If n = 2, a group will contain four 1's since 22 = 4.
Rules of Simplification (Cont.)
Digital Logic and Switching Theory

• Each group should be as large as possible.


Rules of Simplification (Cont.)
Digital Logic and Switching Theory

• Each cell containing a one must be in at least one group.


Rules of Simplification (Cont.)
Digital Logic and Switching Theory

• Groups may overlap.


Rules of Simplification (Cont.)
Digital Logic and Switching Theory

• Groups may wrap around the table. The leftmost cell in a


row may be grouped with the rightmost cell and the top
cell in a column may be grouped with the bottom cell.
Rules of Simplification (Cont.)
Digital Logic and Switching Theory

• There should be as few groups as possible, as long as this


does not contradict any of the previous rules.

You might also like