Boolean Decomposition Using Two-literal Divisors

Authors:
Nilesh Modi;Jordi Cortadella
Affiliations:
-;-
Venue:
VLSID '04 Proceedings of the 17th International Conference on VLSI Design
Year:
2004

Citing 0
Cited 1

Decomposition of systems of Boolean functions determined by binary decision diagrams

Journal of Computer and Systems Sciences International

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is an attempt to answer the following question:how much improvement can be obtained in logic decompositionby using Boolean divisors? Traditionally, the existence of toomany Boolean divisors has been the main reason why Booleandecomposition has had limited success. This paper explores anew strategy based on the decomposition of Boolean functionsby means of two-literal divisors. The strategy is shown to derivesuperior results while still maintaining an affordable complexity.The results show improvements of 15% on average, andup to 50% in some examples, w.r.t. algebraic decomposition.