By Topic

Boolean matching for incompletely specified functions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kuo-Hua Wang ; Dept. of Comput. Sci. & Inf. Eng., Fu Jen Catholic Univ., Taipei Hsien, Taiwan ; TingTing Hwang

Boolean matching is to check the equivalence of two functions under input permutation and input/output phase assignment. In this paper, we address Boolean matching problems for incompletely specified functions. We formulate the searching of input variable mapping between two target functions as a logic equation by using multiple-valued functions. Based on this equation, a Boolean matching algorithm is proposed. Delay and power dissipation can also be taken into consideration when this method is used for technology mapping. Experimental results on a set of benchmarks show that our algorithm is indeed very effective in solving the Boolean matching problem for incompletely specified functions

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:16 ,  Issue: 2 )