Title :
Signature based Boolean matching in the presence of don’t cares
Author :
Abdollahi, Afshin
Author_Institution :
Univ. of California, Riverside, CA
Abstract :
Boolean 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 used for Boolean matching of completely specified functions. In this paper for the first time we use signatures to determine the equivalency of incompletely specified functions.
Keywords :
Boolean functions; Boolean matching; equivalency; incompletely specified functions; input permutation; input phase assignment; output phase assignment; signatures; Algorithm design and analysis; Boolean functions; Clustering algorithms; Data structures; Design optimization; Libraries; Matched filters; Network synthesis; Permission; Testing; Boolean Matching; Don’t Cares; Library Cell Binding; Signatures; Technology Mapping;
Conference_Titel :
Design Automation Conference, 2008. DAC 2008. 45th ACM/IEEE
Conference_Location :
Anaheim, CA
Print_ISBN :
978-1-60558-115-6
