The 'regularity' of a Boolean function can be exploited to decrease its minimization time. In particular, a recent paper shows that the notion of autosymmetry is a valid measure of regularity. Autosymmetric functions have been studied in a tree-level logic framework. In this paper we propose the exploiting of autosimmetry in any logic minimization contest. The aim of this paper is twofold: we extend the notion of autosymmetry to not completely specified Boolean functions, and we propose an implicit autosimmetry test algorithm.
Implicit Test of Regularity for Incompletely Specified Boolean Functions
BERNASCONI, ANNA;PAGLI, LINDA
2002-01-01
Abstract
The 'regularity' of a Boolean function can be exploited to decrease its minimization time. In particular, a recent paper shows that the notion of autosymmetry is a valid measure of regularity. Autosymmetric functions have been studied in a tree-level logic framework. In this paper we propose the exploiting of autosimmetry in any logic minimization contest. The aim of this paper is twofold: we extend the notion of autosymmetry to not completely specified Boolean functions, and we propose an implicit autosimmetry test algorithm.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
