By Topic

Verifying equivalence of functions with unknown input correspondence

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)
David Ihsin Cheng ; Dept. of Electr. & Comput. Eng., Univ. of California, Santa Barbara, CA, USA ; Marek-Sadowska, M.

It is pointed out by the authors that most of the methods that tackle the problem of verifying equivalence of two Boolean functions assume that the correspondence of input variables is known. A method that does not require this assumption is proposed. The key to the method is to associate a new signature with each input variable, thereby effectively establishing partial (sometimes total) correspondence between the sets of input variables. The descriptive power of the new signature appears to be very effective

Published in:

Design Automation, 1993, with the European Event in ASIC Design. Proceedings. [4th] European Conference on

Date of Conference:

22-25 Feb 1993