Scribd
Upload
44 views22 pages

3K Map

The Karnaugh map method provides a simple way to minimize Boolean functions by grouping adjacent 1s in a truth table into the largest possible squares and rectangles. It represents a truth table pictorially and is also known as a K-map. Rules for simplifying K-maps include grouping only 1s, forming groups at right angles, and making groups as large as possible while keeping them a power of 2. Examples show how 2-variable and 3-variable logic functions can be simplified using K-maps.

Uploaded by

sivaani sangeetha
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
44 views22 pages

3K Map

The Karnaugh map method provides a simple way to minimize Boolean functions by grouping adjacent 1s in a truth table into the largest possible squares and rectangles. It represents a truth table pictorially and is also known as a K-map. Rules for simplifying K-maps include grouping only 1s, forming groups at right angles, and making groups as large as possible while keeping them a power of 2. Examples show how 2-variable and 3-variable logic functions can be simplified using K-maps.

Uploaded by

sivaani sangeetha
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/ 22

The MAP Method

• The complexity of the digital logic gates is directly


related to the complexity of the algebraic expression.
• The map method provides a simple, straightforward
procedure for minimizing Boolean functions.
• This method is regarded as a pictorial form of a truth
table.
• The map method is also known as the Karnaugh map or
K-map .

© 2009 Pearson Education


K-Map

(OR)

Two-Variable K-Map

© 2009 Pearson Education


Karnaugh maps
• 3 variables Karnaugh map

Cell = 23=8
AB
C 00 01 11 10
0 2 6 4
0 A B C A BC ABC AB C (OR)

1 3 7 5
1 A B C A BC ABC AB C
Karnaugh maps
• 4 variables Karnaugh map
AB
CD 00 01 11 10
0 4 12 8
00
1 5 13 9
01
3 7 15 11
11

2 6 14 10
10
Karnaugh maps
• 4 variables Karnaugh map
Karnaugh maps
• The Karnaugh map is completed by entering a '1‘(or
‘0’) in each of the appropriate cells.
• Within the map, adjacent cells containing 1's (or 0’s)
are grouped together in twos, fours, or eights.

© 2009 Pearson Education


Kmap Simplification
The rules of Kmap simplification are:
• Groupings can contain only 1s; no 0s.
• Groups can be formed only at right angles;
diagonal groups are not allowed.
• The number of 1s in a group must be a power of
2 – even if it contains a single 1.
• The groups must be made as large as possible.
• Groups can overlap and wrap around the sides
of the Kmap.

© 2009 Pearson Education


K-map Simplification

© 2009 Pearson Education


Kmap Simplification

© 2009 Pearson Education


Kmap Simplification

© 2009 Pearson Education


Kmap Simplification

© 2009 Pearson Education


Kmap Simplification

© 2009 Pearson Education


Example
2-variable Karnaugh maps are trivial but can be used to introduce
the methods you need to learn. The map for a 2-input OR gate
looks like this:
A
0 1
A B
Y 0 1
B
A
1 1 1
A B Y
0 0 0
B
0 1 1
1 0 1
A+B
1 1 1

© 2009 Pearson Education


Example
A B C Y AC
0 0 0 1 BC
0 0 1 1 00 01 11 10
A
0 1 0 0 0
0 1 1 0
1 1
1 0 0 1 1 1 1 1
1 0 1 1
1 1 0 1
1 1 1 0 B

B  AC

You might also like