By Topic

Permutation and phase independent Boolean comparison

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
$33 $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)
Mohnke, J. ; Dept. of Comput. Sci., Humboldt Univ., Berlin, Germany ; Malik, S.

The problem of checking the equivalence of two Boolean functions under arbitrary input permutations and/or input plane assignments is considered. This problem has several applications in the synthesis and verification of combinational logic. The approach presented computes a signature for each variable or phase of a variable that will help establish correspondence of variables or phases of variables. The strength of the proposed approach depends on the ability to quickly derive a signature with minimum aliasing. Aliasing refers to two different variables or phases having the same signature, thus rendering this signature useless for the purpose of distinguishing between them. Experimental results on a large number of examples establish the efficacy of this approach

Published in:

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

Date of Conference:

22-25 Feb 1993