Abstract
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure of regularity, however such a notion has been studied thus far either in the theoretical framework of self-dual Boolean functions, or for the synthesis of a particular family of three-level logic networks. In this paper we show that the degree of autosymmetry of an arbitrary function can be computed implicitly in a very efficient way, and autosymmetry can then be exploited in any logic minimization context. Our algorithms make crucial use of Binary Decision Diagrams. A set of experimental results on the synthesis of standard benchmark functions substantiates the practical relevance of our theoretical results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Bernasconi, A., Ciriani, V., Luccio, F. et al. Exploiting Regularities for Boolean Function Synthesis. Theory Comput Syst 39, 485–501 (2006). https://doi.org/10.1007/s00224-004-1171-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00224-004-1171-5