Skip to Main content Skip to Navigation
Conference papers

Improvements to Satisfiability-Based Boolean Function Bi-Decomposition

Abstract : Boolean function bi-decomposition is pervasive in logic synthesis. Bi-decomposition entails the decomposition of a Boolean function into two other functions connected by a simple two-input gate. Existing solutions are based on Binary Decision Diagrams (BDDs) and, more recently, on Boolean Satisfiability (SAT). Recent work exploited the identification of Minimally Unsatisfiable Subformulas (MUSes) for computing the sets of variables to use in Boolean function bi-decomposition. This paper develops new techniques for improving the use of MUSes in function bi-decomposition. The first technique exploits structural properties of the function being decomposed, whereas the second technique exploits group-oriented MUSes. Experimental results obtained on representative benchmarks from logic synthesis demonstrate significant improvements both in performance and in the quality of decompositions.
Complete list of metadatas

Cited literature [43 references]  Display  Hide  Download

https://hal.inria.fr/hal-01519765
Contributor : Hal Ifip <>
Submitted on : Tuesday, May 9, 2017 - 11:39:56 AM
Last modification on : Thursday, March 5, 2020 - 5:40:32 PM
Document(s) archivé(s) le : Thursday, August 10, 2017 - 12:41:15 PM

File

978-3-642-32770-4_4_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Huan Chen, Joao Marques-Silva. Improvements to Satisfiability-Based Boolean Function Bi-Decomposition. 19th International Conference on Very Large Scale Integration (VLSISOC), Oct 2011, Hong Kong, China. pp.52-72, ⟨10.1007/978-3-642-32770-4_4⟩. ⟨hal-01519765⟩

Share

Metrics

Record views

131

Files downloads

175