CINECA IRIS Institutional Research Information System
IRIS è la soluzione IT che facilita la raccolta e la gestione dei dati relativi alle attività e ai prodotti della ricerca. Fornisce a ricercatori, amministratori e valutatori gli strumenti per monitorare i risultati della ricerca, aumentarne la visibilità e allocare in modo efficace le risorse disponibili.
EnglishThe '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.
| Titolo: | Implicit Test of Regularity for Incompletely Specified Boolean Functions |
| Autori interni: | |
| Anno del prodotto: | 2002 |
| 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. |
| Handle: | http://hdl.handle.net/11568/204546 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
Copyright © 2020