An efficient cost-based canonical form for Boolean matching
Abstract
References
Index Terms
- An efficient cost-based canonical form for Boolean matching
Recommendations
Efficient computation of canonical form for Boolean matching in large libraries
ASP-DAC '04: Proceedings of the 2004 Asia and South Pacific Design Automation ConferenceThis paper presents an efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large. As a basis of the Boolean matching, we use the notion NP-representative (NPR); two functions ...
Efficient Computation of Canonical Form under Variable Permutation and Negation for Boolean Matching in Large Libraries
This paper presents an efficient technique for solving a Boolean matching problem in cell-library binding, where the number of cells in the library is large. As a basis of the Boolean matching, we use the notion NP-representative (NPR): two functions ...
Signature based Boolean matching in the presence of don't cares
DAC '08: Proceedings of the 45th annual Design Automation ConferenceBoolean matching is to determine whether two functions are equivalent under input permutation and input/output phase assignment. This paper will address the Boolean Matching problem for incompletely specified functions. Signatures have previously been ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Hai Zhou,
- Enrico Macii,
- Program Chairs:
- Zhiyuan Yan,
- Yehia Massoud
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigda
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 111Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in