Referenced Items are not available for this document.
A Boolean relation can specify some types of flexibility of a combinational circuit that cannot be expressed with don't cares. Several problems in logic synthesis, such as Boolean decomposition or multilevel minimization, can be modeled with Boolean relations. However, solving Boolean relations is a computationally expensive task. This paper presents a novel recursive algorithm for solving Boolean relations. The algorithm has several features: efficiency, wide exploration of solutions, and customizable cost function. The experimental results show the applicability of the method in logic minimization problems and tangible improvements with regard to previous heuristic approaches.
Published in:
Computers, IEEE Transactions on
(Volume:58
,
Issue:
4
)
Date of Publication: April 2009
- Page(s):
- 512 - 527
- ISSN :
- 0018-9340
- INSPEC Accession Number:
- 10500841
- Digital Object Identifier :
- 10.1109/TC.2008.165
- Product Type:
- Journals & Magazines
- Date of Publication :
- 12 September 2008
- Date of Current Version :
- 27 February 2009
- Issue Date :
- April 2009
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
