Scribd
Upload
18 views

EDA Heuristic Optimization

The document summarizes two methods for heuristic minimization of two-level combinational logic: 1) The Quine-McCluskey method which resolves a function into prime implicants. 2) The resolution method which also resolves a function into prime implicants. 3) The heuristic optimization method which checks the feasibility of logic minimization operations like deleting variables and expanding terms to arrive at an optimized logic function in the fewest steps.

Uploaded by

YQ W
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
18 views

EDA Heuristic Optimization

The document summarizes two methods for heuristic minimization of two-level combinational logic: 1) The Quine-McCluskey method which resolves a function into prime implicants. 2) The resolution method which also resolves a function into prime implicants. 3) The heuristic optimization method which checks the feasibility of logic minimization operations like deleting variables and expanding terms to arrive at an optimized logic function in the fewest steps.

Uploaded by

YQ W
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Heuristic Minimization of Two-Level

Combinational Logic

Lecture notes P34-P36

1
Quine–McCluskey Method

yz 111

011 110 101

xy
010 001 100

000
xz
xyz

f(x,y,z)=xyz+xy+yz
=xyz+(xyz+xyz)+(xyz+xyz)
=xz +xy+yz =p1 +p2 +p3 2
Resolution Method

yz 111

011 110 101

xy
010 001 100

000
xz
xyz

f(x,y,z)=xyz+xy+yz
=xyz+(xyz+xyz)+(xyz+xyz)
=xz +xy+yz =p1 +p2 +p3 3
Heuristic Optimization

delete yz 111

011 110 101

delete xy
Remove
010 001 100

000

yz
xz
delete x
Expand xyz
delete y Heuristic optimization:
• Check feasibility after operations
f(x,y,z)=xz+yz • A strategy for checking direction
4
Expand

xyz yz
011 111

001 101 xz covers the expanded xyz

010 110

000 100

xz xy

f(x,y,z)=xyz+xz+xy+xz

5
Remove

yz
011 111

001 101
xz=xyz+xyz are
covered twice
010 110

000 100

xz xy

f(x,y,z)=yz+xz+xy+xz

6
Containment

yz
011 111

001 101
xz  yz+xy+xz

010 110

000 100

xz xy

7
Reduce

xy xyz yz
011 111

xz
001 101

010 110

000 100

xz xy

f(x,y,z)=xy+xz+xy+xz
=yz+xy+xz
8
Reduce

xy
011 111

xz
001 101

010 110

000 100

xz yz xy xyz

f(x,y,z)=xy+xz+xy+xz
=xy+yz+xz
9
Thanks.

10

You might also like