Generalized cofactoring for logic function evaluation
Yunjian Jiang
Matic, S.
Brayton, R.K.
Univ. of California, Berkeley, CA, USA;
This paper appears in: Design Automation Conference, 2003. Proceedings
Publication Date: 2-6 June 2003
On page(s): 155- 158
ISBN: 1-58113-688-9
INSPEC Accession Number: 7852965
Current Version Published: 2003-08-11
Abstract
Logic evaluation of a Boolean function or relation is traditionally done by simulating its gate-level implementation, or creating a branching program using its binary decision diagram (BDD) representation, or using a set of look-up tables. We propose a new approach called generalized cofactoring diagrams, which are a generalization of the above methods. Algorithms are given for finding the optimal cofactoring structure for free-ordered BDD's and generalized cube cofactoring under an average path level (APL) cost criterion. Experiments on multi-valued functions show superior results to previously known methods by an average of 30%. The framework has direct applications in logic simulation, software synthesis for embedded control applications, and functional decomposition in logic synthesis.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
