Loading...
QBF-based boolean function bi-decomposition
Date
2012
Abstract
Boolean function bi-decomposition is ubiquitous in logic synthesis. It entails the decomposition of a Boolean function using two-input simple logic gates. Existing solutions for bidecomposition are often based on BDDs and, more recently, on Boolean Satisfiability. In addition, the partition of the input set of variables is either assumed, or heuristic solutions are considered for finding good partitions. In contrast to earlier work, this paper proposes the use of Quantified Boolean Formulas (QBF) for computing bi-decompositions. These bi-decompositions are optimal in terms of the achieved quality of the input set of variables. Experimental results, obtained on representative benchmarks, demonstrate clear improvements in the quality of computed decompositions, but also the practical feasibility of QBF-based bi-decomposition.
Supervisor
Description
peer-reviewed
Publisher
IEEE Computer Society
Citation
Design, Automation & Test in Europe Conference & Exhibition;pp. 816-819
Files
Loading...
Chen_2012_QBF.pdf
Adobe PDF, 140.62 KB
ULRR Identifiers
Funding code
Funding Information
Science Foundation Ireland (SFI)