Scribd
Upload
217 views9 pages

Karnaugh Map PDF

The document discusses Karnaugh maps, which provide a graphical method for minimizing logic functions expressed as sums-of-products. Karnaugh maps arrange the minterms of a logic function into a grid, with adjacent minterms differing in only one variable. Minterms can be combined by looping together adjacent '1's in the map, eliminating a variable from the logic expression. Larger groupings are preferred, and guidelines are provided for combining terms in the map. Examples of 2, 3, and 4 variable Karnaugh maps are shown, along with minimized logic expressions obtained from different mappings.

Uploaded by

Nuwan Sameera
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
217 views9 pages

Karnaugh Map PDF

The document discusses Karnaugh maps, which provide a graphical method for minimizing logic functions expressed as sums-of-products. Karnaugh maps arrange the minterms of a logic function into a grid, with adjacent minterms differing in only one variable. Minterms can be combined by looping together adjacent '1's in the map, eliminating a variable from the logic expression. Larger groupings are preferred, and guidelines are provided for combining terms in the map. Examples of 2, 3, and 4 variable Karnaugh maps are shown, along with minimized logic expressions obtained from different mappings.

Uploaded by

Nuwan Sameera
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/ 9

ECE380 Digital Logic

Optimized Implementation of
Logic Functions:
Karnaugh Maps and Minimum
Sum-of-Product Forms
Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-1

Karnaugh map
The key to finding a minimum cost SOP or
POS form is applying the combining property
(14a for SOP or 14b for POS)
The Karnaugh map (K-map) provides a
systematic (and graphical) way of performing
this operation
Minterms can be combined by 14a when they
differ in only one variable
f(x,y,z) = xyz+xyz = xy(z+z) = xy(1) = xy

The K-map illustrates this combination


graphically
Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-2

Karnaugh map
The K-map is an alternative to a truth table for
representing an expression
K-map consists of cells that correspond to rows of the truth
table
Each cell corresponds to a minterm

A two variable truth table and the corresponding Kmap


x2

x1

x2

m0

m1

m2

m3

x1

m0

m2

m1

m3

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-3

Karnaugh map
x1

Values for the first variable


are listed across the top

m0

m2

m1

m3

x2

Values for the second variable


are listed down the left side
Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-4

Karnaugh map groupings


Minterms in adjacent squares on the map can be
combined since they differ in only one variable
Indicated by looping the corresponding 1s on the
map (the 1s must be adjacent)
Looping two 1s together corresponds to eliminating
a term and a variable from the output expression =>
x
xy+xy = x
0

f=xy+xy=x

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-5

K-map groupings example


y
x

f=x+y

Note that the bottom two cells differ in only one


variable (x) and the right two cells differ in only one
variable (y)

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-6

K-map groupings example


Draw the K-map and give the minimized logic
expression for the following truth table.
Show the groupings made in the K-map
x

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-7

Three variable K-map


A three-variable K-map is constructing by laying 2 two-variable
maps side by side
K-map are always laid out such that adjacent squares only
differ by one variable (i.e. by 1 bit in the binary expression of
the minterm values)
x
0
0
0
0
1
1
1
1

y
0
0
1
1
0
0
1
1

z
0
1
0
1
0
1
0
1

Minterm
m0=xyz
m1=xyz
m2=xyz
m3=xyz
m4=xyz
m5=xyz
m6=xyz
m7=xyz

Electrical & Computer Engineering

xy

00

01

11

10

m0

m2

m6

m4

m1

m3

m7

m5

End cells are adjacent


Dr. D. J. Jackson Lecture 7-8

Example three-variable K-maps


f(x,y,z)=m(0,1,2,4)
=xy+xz+yz

f(x,y,z)=m(0,1,2,3,4)
=x+yz

xy

00

01

11

10

00

01

11

10

xy

A grouping of four eliminates 2 variables


Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-9

Guidelines for combining terms

Can combine only adjacent 1s


Can group only in powers of 2 (1,2,4,8, etc.)
Try to form as large a grouping as possible
Do not generate more groups than are
necessary to cover all the 1s

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-10

Example groupings
xy
00
z
0
1
1

01

11

10

xy
00
z
0
0
1

f=z
xy
00
z
0
1
1

01

11

10

f=yz+x

01

11

10

f=z+y
Electrical & Computer Engineering

xy
00
z
0
1
1

01

11

10

f=y+xz
Dr. D. J. Jackson Lecture 7-11

K-map groupings example


Draw the K-map and give the minimized logic
expression for the following.
f(a,b,c)=m(1,2,3,4,5,6)

Show the groupings made in the K-map

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-12

Four variable K-map


A four-variable K-map is constructing by laying 2
three-variable maps together to create four rows
f(a,b,c,d)
ab

00

01

11

10

00

m0

m4

m12

m8

01

m1

m5

m13

m9

11

m3

m7

m15

m11

10

m2

m6

m14

m10

cd

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-13

Four variable K-map


Adjacencies wrap around in the K-map
ab 00

01

11

10

00

m0

m4

m12

m8

01

m1

m5

m13

m9

11

m3

m7

m15

m11

10

m2

m6

m14

m10

cd

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-14

Example four-variable K-maps


ab
00
cd
00 0

f(a,b,c,d)=m(2,3,9-11,13)
=acd+bc

f(a,b,c,d)=m(3-7,9,11,12-15)
=b+cd+ad

01

11 10

01

11

10

01

11 10

ab
00
cd
00 0
01

11

10

Electrical & Computer Engineering

Dr. D. J. Jackson Lecture 7-15

Example groupings
ab
00
cd
00 1

01

11 10

ab
00
cd
00 0

01

11 10

01

01

11

11

10

10

f(a,b,c,d)=b+d

Electrical & Computer Engineering

f(a,b,c,d)=bd+bd

Dr. D. J. Jackson Lecture 7-16

Example groupings
ab
00
cd
00 1

01

11 10

ab
00
cd
00 1

01

11 10

01

01

11

11

10

10

f(a,b,c,d)=bd+bd

Electrical & Computer Engineering

f(a,b,c,d)=bd+bd+ab

Dr. D. J. Jackson Lecture 7-17

You might also like