Archivio Istituzionale della RicercaThe state space explosion due to memory elements makes symbolic traversal techniques best suited to control-dominated circuits, rather than data paths. To take the latter ones into account, auxiliary variables are used to partition a Boolean function in simpler ones and to express it implicitly as a composition. Experimental results demonstrate the benefits both in terms of memory requirements and CPU time.
Boolean Function Decomposition in Symbolic FSM Traversal / Cabodi, Gianpiero; Camurati, Paolo Enrico; Quer, Stefano. - STAMPA. - (1993), pp. 265-268. (Intervento presentato al convegno ICVC'93: IEEE 3rd International Conference on VLSI and CAD tenutosi a Taejon, Korea nel November 1993).
Boolean Function Decomposition in Symbolic FSM Traversal
CABODI, Gianpiero;CAMURATI, Paolo Enrico;QUER, Stefano
1993
Abstract
The state space explosion due to memory elements makes symbolic traversal techniques best suited to control-dominated circuits, rather than data paths. To take the latter ones into account, auxiliary variables are used to partition a Boolean function in simpler ones and to express it implicitly as a composition. Experimental results demonstrate the benefits both in terms of memory requirements and CPU time.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2501455
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo