Sciweavers

3 search results - page 1 / 1
» Symmetry detection for incompletely specified functions
Sort
View
DAC
2004
ACM
13 years 8 months ago
Symmetry detection for incompletely specified functions
In this paper, we formulate symmetry detection for incompletely specified functions as an equation without using cofactor computation and equivalence checking. Based on this equat...
Kuo-Hua Wang, Jia-Hung Chen
DAC
2006
ACM
14 years 5 months ago
Symmetry detection for large Boolean functions using circuit representation, simulation, and satisfiability
- Classical two-variable symmetries play an important role in many EDA applications, ranging from logic synthesis to formal verification. This paper proposes a complete circuit-bas...
Jin S. Zhang, Alan Mishchenko, Robert K. Brayton, ...
DAC
1994
ACM
13 years 8 months ago
Boolean Matching Using Generalized Reed-Muller Forms
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
Chien-Chung Tsai, Malgorzata Marek-Sadowska