Scribd
Upload
38 views8 pages

K Maps1

This document introduces Karnaugh maps as an alternative way to represent Boolean functions that allows for minimizing logic. Karnaugh maps arrange the rows of a truth table on a grid where each square represents a minterm. Circles are drawn around groups of "1" values to find product terms according to simplification rules. This results in a minimized sum-of-products expression requiring less logic than the unoptimized form.

Uploaded by

Christina josephine malathi
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
38 views8 pages

K Maps1

This document introduces Karnaugh maps as an alternative way to represent Boolean functions that allows for minimizing logic. Karnaugh maps arrange the rows of a truth table on a grid where each square represents a minterm. Circles are drawn around groups of "1" values to find product terms according to simplification rules. This results in a minimized sum-of-products expression requiring less logic than the unoptimized form.

Uploaded by

Christina josephine malathi
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/ 8

Karnaugh Maps

ECE2003-Digital Logic Design 1


Overview
 K-maps: an alternate approach to representing Boolean
functions
 K-map representation can be used to minimize Boolean
functions
 Easy conversion from truth table to K-map to minimized
SOP representation.
 Simple rules (steps) used to perform minimization
 Leads to minimized SOP representation.
 Much faster and more more efficient than previous

minimization techniques with Boolean algebra.

ECE2003-Digital Logic Design 2


Karnaugh maps
 Alternate way of representing Boolean function
 All rows of truth table represented with a square

 Each square represents a minterm

 Easy to convert between truth table, K-map, and SOP


 Unoptimized form: number of 1’s in K-map equals

number of minterms (products) in SOP


 Optimized form: reduced number of minterms

y F = Σ(m0,m1) = x’y + x’y’ x y F


y
x 0 1 y 0 0 1
x 0 1
0 x’y’ x’y 0 1 1
0 1 1
x 1 xy’ xy 1 0 0
1 0 0
1 1 0

ECE2003-Digital Logic Design 3


Karnaugh Maps
 A Karnaugh map is a graphical tool for assisting in the
general simplification procedure.
 Two variable maps.
B B
A 0 1 A 0 1
00 1 F=AB +A’B 00 1 F=AB +AB +AB 
11 0 11 1
A B C F
° Three variable maps. 0 0 0 0
BC 0 0 1 1
00 01 11 10 0 1 0 1
A 0 1 1 0
00 1 0 1 1 0 0 1
11 1 1 1 1
1
0 1
1 0
1
1
+
1 1 1 1
F=AB’C’ +AB C +ABC +ABC  + A’B’C + A’BC’
ECE2003-Digital Logic Design 4
Rules for K-Maps
 We can reduce functions by circling 1’s in the K-map
 Each circle represents minterm reduction
 Following circling, we can deduce minimized and-or
form.
Rules to consider
 Every cell containing a 1 must be included at least
once.
 The largest possible “power of 2 rectangle” must be
enclosed.

ECE2003-Digital Logic Design 5


Karnaugh Maps
 A Karnaugh map is a graphical tool for assisting in the
general simplification procedure.
 Two variable maps.
B B
A 0 1 A 0 1
00 1 F=AB +A’B 00 1 F=AB +AB +AB 
11 0 11 1 F=A+B
° Three variable maps.
BC
00 01 11 10
A
00 1 0 1
1 1 1 1 1 F=A+B C +BC 
F=AB’C’ +AB C +ABC +ABC  + A’B’C + A’BC’
ECE2003-Digital Logic Design 6
ECE2003-Digital Logic Design 7
Summary
 Karnaugh map allows us to represent functions
with new notation
 Representation allows for logic reduction.
 Implement same function with less logic

 Each square represents one minterm


 Each circle leads to one product term
 Not all functions can be reduced
 Each circle represents an application of:
 Distributive rule -- x(y + z) = xy + xz
 Complement rule – x + x’ = 1

ECE2003-Digital Logic Design 8

You might also like