QBF-Based Boolean Function Bi-Decomposition
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 bi-decomposition 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 disjointness and balancedness 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.
Cite
@article{arxiv.1112.2313,
title = {QBF-Based Boolean Function Bi-Decomposition},
author = {Huan Chen and Mikolas Janota and Joao Marques-Silva},
journal= {arXiv preprint arXiv:1112.2313},
year = {2011}
}
Comments
This paper is an extension of the DATE'2012 paper "QBF-Based Boolean Function Bi-Decomposition" by Huan Chen, Mikolas Janota, Joao Marques-Silva