Boolean Function Decomposition in Symbolic FSM Traversal
Gianpiero Cabodi, Paolo Enrico Camurati, Stefano Quer · PORTO Publications Open Repository TOrino (Politecnico di Torino) · 1993
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