EE370

Digital Electronics

L12: Logic synthesis _part-2

B. Mazhari
Dept. of EE, IIT Kanpur

189
G-Number
B. Mazhari, IITK
Two Level Minimization SOP : Y = x1x2x3 + x1x4 +

minimize the number of product terms

minimize the number of literals in each term

K-map : xy x y x

No. of product terms and no. of literals are reduced

190
G-Number
B. Mazhari, IITK
KMAP

xy x y x

To apply this principle one has to search Boolean exp.

or truth table for suitable pairs of product terms

Kmap facilitates this search process

Q1Q0
x 0 0 0 1 1 1 1 0

0 1 0 0 1

1 0 1 0 1

D1 = Q1 Q0 + x Q0 + x Q1 Q0
191
G-Number
B. Mazhari, IITK
 VLSI is all about managing complexity !

An algorithm has to be evaluated on the basis of how

It scales with problem size ~O(n)

Q1Q0
x 0 0 0 1 1 1 1 0

0 1 0 0 1

1 0 1 0 1

D1 = Q1 Q0 + x Q0 + x Q1 Q0

Kmap becomes unwieldy beyond a couple of variables

Better method for larger inputs: Quine-McCluskey (QM)
192
G-Number
B. Mazhari, IITK
Definitions:

Implicant each minterm for which o/p is 1

5 implicants : xQ1 Q0 ; xQ1 Q0 ...........

ON set : set of implicants

Implicants can be combined or grown

193
G-Number
B. Mazhari, IITK
Definitions:

Q1Q0
x 0 0 0 1 1 1 1 0

0 1 0 1 0
A 1 1 1 1 0

D
B C

Prime Implicant implicant which cant be combined

with any other implicant

4 PI: A; B; C ; D
194
G-Number
B. Mazhari, IITK
Definitions:

Q1Q0
x 0 0 0 1 1 1 1 0

0 1 0 1 0
A 1 1 1 1 0

D
B C

Essential Prime Implicant: it covers at least one minterm

Which no other PI covers

2 EPI: A; D
195
G-Number
B. Mazhari, IITK
Two Level Minimization

-Cover the ON set with minimum number of PI

Find all the Prime implicants

Find a minimum set of PIs to cover the ON set

Q1Q0
2 EPI:
x 0 0 0 1 1 1 1 0 A; D
0 1 0 1 0
A 1 1 1 1 0

D A,D,B
B C
A,D,C
196
G-Number
B. Mazhari, IITK
QM-1 ON Set of Higher order Implicants Higher order Implicants
the (First Pass) (Second Pass)
Function

0000 (0) -000 (0, 8) -000 (A) (0, 8)

0101 (5) 01-1 (5, 7) 01-1 ( B) (5, 7)
0111 (7) -111 (7, 15) -111 (C) (7, 15)
1000 (8) 100- (8, 9) 10-- (D) (8, 9, 10, 11)
1001 (9) 10-0 (8, 10) 1-1- (E) (10,11,14,15)
Find PI
1010 (10) 10-1 (9, 11)

1011 (11) 101- (10, 11)

1110 (14) 1-10 (10, 14)

1111 (15) 1-11 (11, 15)

111- (14, 15)

197
G-Number
B. Mazhari, IITK
QM- 2 : minimal cover

Minterm A B C D E
0
5
2.1
7
8
9
10
11
14
15

2.2Find all essential PI : Find single entry rows (A,B,D,E)

198
G-Number
B. Mazhari, IITK
 Minterm A B C D E
0
5
7
8
9
10
11
14
15

Cover = {A, B, D, E}
199
G-Number
B. Mazhari, IITK
Example 2
Minterm A B C D E

M1

M2

M3

M4

M5

M6

Row 6 dominates Row-1 Remove Row-6

Row-4 dominates Row-5 Remove Row-4 200
G-Number
B. Mazhari, IITK
Simplified Table

Minterm A B C D E

M1
M2
M3
M5

Col. B dominates col. A Remove col. A

Col. D dominates col. E Remove col. E

Step 2.4 : Use row and column dominance to simplify

201
G-Number
B. Mazhari, IITK
Simplified Table

Minterm B C D

M1

M2

M3

M5

B, D essential so include them in cover and

Remove minterms covered by them table empty

Cover = {B, D}
202
G-Number
B. Mazhari, IITK
Simplified Table: Non-empty

Minterm A B C D E F
M0
M1
M4
M6
M8
M10
M12

Search for the optimum combination of PI

203
G-Number
B. Mazhari, IITK
Branch and Bound Search

Include A Discard A

Inc. B Dis. B Dis. B

Inc. B

Suppose we include A in our cover: {A,

204
G-Number
B. Mazhari, IITK
 Minterm A B C D E F
M0
M1
M4
M6
M8
M10
M12

205
G-Number
B. Mazhari, IITK
 Minterm B C D E F

M4
M6
M8
M10
M12

Solution : {A,C,D}.
Include A Discard A

But is this minimal? sol. Dis. B

Inc. B

206
G-Number
B. Mazhari, IITK
The search along any branch may be terminated if we
can predict that solutions obtained by following that
branch will either have same or larger number of PI than
the best solution found so far.

Include A Discard A

Predict here
sol. Dis. B
Inc. B

207
G-Number
B. Mazhari, IITK
Include A Discard A

sol. Dis. B
Inc. B

Minterm A B C D E F
M0
M1
M4
M6
M8
M10
M12
208
G-Number
B. Mazhari, IITK
Table without A
Minimum no. of PI? Include A Discard A

sol. Dis. B
Inc. B

Minterm B C D E F
M0
M1
M4
M6
M8
M10
M12

Min. PI >= number of pair-wise independent rows in

the prime implicant table
Row 1,4 and 8 : A solution along this path must have
AtIITKleast 3 PI Solution found is optimal
B. Mazhari,
209 G-Number
Heuristics for selecting branching column

Include A,B ? Discard A,B?

common heuristic :

1. Find the set of columns that cover the pair-wise

independent rows

2.Select the column that covers the maximum number of

rows
B. Mazhari, IITK
210 G-Number
 Minterm A B C D E F
M0
M1
M4
M6
M8
M10
M12

Independent rows are 1,4,8

A covers 2 rows
F covers 3 rows
Row-1 is covered by columns A, F C covers 3 rows
Row-4 is covered by columns C,E E covers 2 rows
Row-8 is covered by columns B,D B covers 2 rows
D covers 2 rows
211
G-Number
B. Mazhari, IITK
If we choose C we get the solution {C,A,D}. On the other hand if
we choose F we get {F,E,B} both of which are optimal.

Instead of using the exact branch and bound procedure which is

time consuming, one can use the above heuristic repeatedly to
select columns to include in the cover.

The resulting cover may not be optimal but the obtained solution
is often good in the sense that often the number of PIs is not far
from minimal.

212
G-Number
B. Mazhari, IITK