Scribd
Upload
9 views26 pages

Lecture 1

Uploaded by

negussenoah
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
9 views26 pages

Lecture 1

Uploaded by

negussenoah
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/ 26

The Map Method

• Simplification of Boolean Expression


– Minimum # of terms, minimum # of literals
– To reduce complexity of digital logic gates
– The simplest expression is not unique
• Methods:
– Algebraic minimization  lack of specific rules
• Section 2.4
– Karnaugh map or K-map
• Combination of 2, 4, … adjacent squares
Logic circuit  Boolean function  Truth table  K-map
 Canonical form (sum of minterms, product of maxterms)
 (Simplifier) standard form (sum of products, product of sums)
The Map Method
A Karnaugh map is a graphical tool for assisting in
the general simplification procedure.
 2 variables  4 minterms  4 squares.

Y’ Y

X’

X
 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.
The 1’s must be enclosed in the smallest possible
number of rectangles.
 Two variable maps:

a a
b 0 1 b 0 1
0 0 1 0 1 1
1 0 1 1 0 0
f=a g = b'

B 0 1
A
00 1
11 0
F=AB+A’B
Two-variable Map

m1 + m2 + m3 = x’y + xy’ + xy = x + y
 Example: F(X,Y) = XY’ + XY
 From the map, we see that
F (X,Y) = X.
Note: There are implied 0s in other boxes.

1 1 X

 This can be justified using algebraic manipulations:


F(X,Y) = XY’ + XY
= X(Y’ +Y)
= X.1
=X
 Example:
G(x,y) = m1 + m2 + m3
Y
G(x,y) = m1 + m2 + m3
= X’Y + XY’ + XY
1
From the map, we can see that
1 1 X
G=X+Y
 Example: x y F
F = Σ(m0,m1) 0 0 1
0 1 1
1 0 0
Using algebraic manipulations 1 1 0
F = Σ(m0,m1)
= x’y + x’y’ y y
y
0 1
= x’ (y+y’) x 0 1 x
0 x’y’ x’y 0 1 1 X’
= x’
x 1 xy’ xy 1 0 0
 3 variables 8 minterms (m0 – m7).

How can we locate a minterm square on the map?


 Use figure (a) OR  use column # and row # from figure (b)
E.g. m5 is in row 1 column 01 (5 10 = 101 2)
Q. Show the area representing X’? Y’? Z’?
Three-Variable map
• 8 minterms for 3 binary variables
• Any two adjacent squares differ by only
one variable

yz
 By combining squares in powers of 2, we reduce
number of literals in a product term, reducing the
literal cost, thereby reducing the other two cost
criteria.
 On a 3-variable K-Map:
◦ One square represents a minterm with three variables
◦ Two adjacent squares represent a product term with two
variables
◦ Four “adjacent” terms represent a product term with one
variables
◦ Eight “adjacent” terms is the function of all ones (logic 1).
 Adjacent Squares
 m0+m2 = XYZ + XYZ = XZ(Y+Y) = XZ
 m4+m6 = XYZ + XYZ = XZ(Y+Y) = ZX

Note that Z’ wraps from left edge to right edge.


 F = X’Y’Z’ + X’YZ’ + XY’Z’ + XYZ’
= Z’ (X’Y’ + X’Y + XY’ + XY)
= Z’ (X’ (Y’+Y) + X (Y’+Y))
= Z’ (X’+ X)
= Z’
 F=AB’C’ +ABC +ABC +ABC + A’B’C + A’BC’
BC
00 01 11 10
A
00 1 0 1
11 1 1 1 F=A+BC +BC
Y
YZ 00 01 11 10
 Example: X
0
F (x, y, z)= Σm (2, 3, 6, 7) 1 1
X 1
Y
1 1

 Applying the Minimization Theorem three times:


F(x, y, z) = x y z + x y z + x y z + x y z
= yz + y z
= y
 Thus the four terms that form a 2 × 2 square correspond to the term
"y".
 Example: Simplify
F (x, y, z)= Σm (2, 3, 4, 5)
Y
YZ 00 01 11 10
X
0 X’Y
1 1
X 1 1 1

XY’ Z

F(X,Y,Z) = X’Y + XY’


 Example: Simplify
G (a, b, c)= Σm (3, 4, 6, 7)

b
bc 00 01 11 10
X
a bc
0 1
a 1 1 1 1

ac’

G (a,b,c) = bc + ac’
 Example: Simplify
F(X, Y, Z) = X’Z + X’Y + XY’Z + YZ
F(X, Y, Z) = Σm (1, 2, 3, 5, 7)
z Y xy
YZ
• In general, as more squares X
00 01 11 10
0
are combined, we obtain a 1 1 1

product term with fewer X 1 1 1

literals.
Z
• Overlap is allowed.

F(x, y, z) = z + x y
Examples 3-1 and 3-2
Examples 3-3 and 3-4
One square represents
one minterm, giving a
term of three literals
• Two adjacent squares
represent a term of two
literals
• Four adjacent squares
represent a term of
one literal
Four-Variable Map

• Two adjacent squares represent a term of three literals


• Four adjacent squares represent a term of two literals
• Eight adjacent squares represent a term of one literal
The larger the number of squares combined, the smaller the
number of literals in the term

Examples 3-5 and 3-6

x
 F = m(0,1,2,4,5,6,8,9,12,13,14)

F = Y’ + XZ’ + W’Z’
 F = m(0,2,4,5,6,7,10,13,15)

 Do it and show it to me next time!

You might also like