DIGITAL ELECTRONICS AND MICROPROCESSORS

BITS Pilani
Pilani Campus

Rekha.A Faculty

Gate Level Minimization and K-Map

Gate level minimization refers to the design task of finding an optimal gate level implementation of the boolean functions describing a digital circuit. The complexity of the digital logic gates that implement the boolean function is directly related to the complexity of the algebraic expression from which the function is implemented. The map method provides a procedure for minimizing the complexity The map method is also known as the Karnaugh graph map or Kmap.

BITS Pilani, Pilani Campus

K-Map is a diagram made up of squares, with each square representing one minterm or maxterm of the function. Two variable Map
y x 0 0
m1 xy

m0 xy m2 xy

m3 xy

BITS Pilani, Pilani Campus

Three Variable K-Map

yz x 0 00
m0 xyz m4 xyz

01
m1 x'yz m5 xyz

11
m3 xyz m7 xyz

10
m2 xyz m6 xyz

BITS Pilani, Pilani Campus

4 Variable K-Map
yz wx 00
m4 m5 m13 m7 m15 m6 m14

00
mo m1

01
m3

11

10
m2

01 11 10
m12

m8

m9

m11

m10

BITS Pilani, Pilani Campus

K-MAP Rules of simplification:

The Karnaugh map uses the followin rules for the simplification of expressions by grouping together adjacent cells containing ones 1. Groups may not include any cell containing a zero

BITS Pilani, Pilani Campus

K-MAP Rules of simplification:

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

BITS Pilani, Pilani Campus

K-MAP Rules of simplification:

3. 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.

BITS Pilani, Pilani Campus

K-MAP Rules of simplification:

4. Each group should be as large as possible.

BITS Pilani, Pilani Campus

K-MAP Rules of simplification:

5. Groups may overlap.

BITS Pilani, Pilani Campus

K-MAP Rules of simplification:

6. 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.

BITS Pilani, Pilani Campus

K-MAP Rules of simplification:

7 . There should be as few groups as possible, as long as this does not contradict any of the previous rules.

BITS Pilani, Pilani Campus

Flow chart for simplification using K-Map

BITS Pilani, Pilani Campus

Simplify the following Boolean expression F(x,y,z)=(2,3,4,5) yz x 00 01 11 0 1

1 1

10

F= xy+xy

BITS Pilani, Pilani Campus

Simplify the following boolean expression F(x,y,z) = (3,4,6,7)

BITS Pilani, Pilani Campus

Problems on K-map
Simplify the following Boolean function F(w,x,y,z)=(0,1,2,4,5,6,8,9,12,13,14) wx 00 01 11 10 00
1 1 1 1 1

01
1 1 1 1 1

11

10
1 1 1 1

F= y+wz+xz
BITS Pilani, Pilani Campus

Dont Care Conditions Functions that have unspecified outputs for some input combinations are called incompletely specified functions. The unspecified minterms of a function is called a dont care conditions. These dont care conditions are marked with X

BITS Pilani, Pilani Campus

Simplify the boolean function F(w, x, y, z)=(1,3,7,11,15) which has the dont care conditions d(w, x, y, z)=(0,2,5) yz wx 00 01 11 10 00 X 1 X
x 1 X 0 0 1 1 1 1 0 0 0 x

01 0 11 0
0

10 F= yz + wx
BITS Pilani, Pilani Campus

Simplify the following Boolean function and Implement using gates. f = ( a, b, c, d) = (2, 8, 11, 15) + d(3, 12, 14) cd ab 00 01 11 10 00 01 11 10
x 0

x 0

0 0

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

BITS Pilani, Pilani Campus

Simplify the following Boolean function into (a)Sum of products (b)Product of sum F=(A,B,C,D)=(0,1,2,5,8,9,10)
CD AB 00 01 11 10 f= BD+BC+ACD
BITS Pilani, Pilani Campus

00

01

11

10

1 0 0 1

1 1 0 1

0 0 0 0

1 0 0 1

F = CD+AB+BD Apply Demorgans Theorem to F CD AB 00 01 11 10

1
00

1 1 0 1

0 0 0 0

1 0 0 1

0
01

0
11 10

F= (A+B) (C+D) (B+D)

BITS Pilani, Pilani Campus

Variable Entered Mapping(VEM) Simplification using K-map becomes slightly tedious if the number of variables is more than 5. In VEM method, the map includes entries like not only the 1s, 0s and dont cares but also Boolean expression or variable.

BITS Pilani, Pilani Campus

Consider the following truth Table A 0 0 0 0 1 1 1 1 B 0 0 1 1 0 0 1 1 C 0 1 0 1 0 1 0 1 F 0 0 1 1 1 0 X X

BITS Pilani, Pilani Campus

F = ABC + ABC + ABC + ABC + ABC + ABC + ABC + ABC F.F= F = ABCF + ABCF + ABCF + ABCF +ABCF + ABCF + ABCF + ABCF =AB(CF+CF)+AB(CF+CF)+AB(CF+CF)+AB(CF+CF) F= AB(C.0+C.0) + AB(C.1+C.1) + AB(C.1+C.0) + AB(C.X+C.X) = AB(0) + AB(C+C) + AB(C) + AB(X) = AB(0) + AB(1) + AB(C) + AB(X)

BITS Pilani, Pilani Campus

A 0 B 0 0 C 1

BITS Pilani, Pilani Campus

VEM Reading Procedure First imagine that all the 1 entries in the map are replaced by the map-entered variables ORed with its complement. Perform looping over the single entry MEV. Once all single MEV entries have been covered , rewrite the map. Replace the MEV and MEV with 0.

BITS Pilani, Pilani Campus

BITS Pilani, Pilani Campus