Archivio Istituzionale della RicercaSymbolic state space traversal techniques are best on control-dominated circuits, not on data paths. This paper extends their applicability to regular structures commonly found in data paths by using auxiliary variables to decompose and to manipulate Boolean functions in decomposed form. Experimental results demonstrate the gain both in terms of binary decision diagram (BDD) size and CPU time.
Symbolic Traversals of Data Paths with Auxiliary Variables / Cabodi, Gianpiero; Camurati, Paolo Enrico; Quer, Stefano. - STAMPA. - (1994), pp. 93-96. (Intervento presentato al convegno GLSV '94: Fourth Great Lakes Symposium on VLSI tenutosi a Notre Dame, Indiana, USA nel March 1994).
Symbolic Traversals of Data Paths with Auxiliary Variables
CABODI, Gianpiero;CAMURATI, Paolo Enrico;QUER, Stefano
1994
Abstract
Symbolic state space traversal techniques are best on control-dominated circuits, not on data paths. This paper extends their applicability to regular structures commonly found in data paths by using auxiliary variables to decompose and to manipulate Boolean functions in decomposed form. Experimental results demonstrate the gain both in terms of binary decision diagram (BDD) size 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/2501429
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo