Options
Design of a Logic Optimization Tool for Exclusive-or Sum-of-Products Expressions
Date Issued
2007
Date
2007
Author(s)
Wang, Chong-An
DOI
en-US
Abstract
A logic optimization tool for minimizing the Exclusive-OR Sum of Product (ESOP) forms in a Multi-output Boolean function is designed. ESOP forms have been proven to require fewer products for many classes of functions than the more common Sum of Product (SOP) forms using inclusive-OR operator. In this Thesis, we propose a particular data structure called Sierpinski Gasket to store the information of ESOP expression. Besides, we also propose a two-stage simulated annealing algorithm to perform the ESOP minimization.
The benefits of applying the particular data structure are that it is very suitable for the ESOP expression and it has lower memory usage in most test cases. The advantage of using the two-stage simulated annealing algorithm is that it can help a solution to escape from a local minimum thus to find an optimum solution more globally. Experimental results show that we achieve better performance and flexibility by adjusting the parameters of the two-stage simulated annealing algorithm.
The benefits of applying the particular data structure are that it is very suitable for the ESOP expression and it has lower memory usage in most test cases. The advantage of using the two-stage simulated annealing algorithm is that it can help a solution to escape from a local minimum thus to find an optimum solution more globally. Experimental results show that we achieve better performance and flexibility by adjusting the parameters of the two-stage simulated annealing algorithm.
Subjects
積之互斥和
互斥閘
邏輯最佳化
Exclusive-or Sum-of-Products
XOR gate
Logic Optimization
Type
thesis
File(s)
No Thumbnail Available
Name
ntu-96-R94943074-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):d69bbe0e75d9f7419ea3f1ebb88bbfc9