FSM encoding for BDD representations
- Author(s): Gosti, W
- Villa, T
- Saldanha, A
- Sangiovanni-Vincentelli, AL
- et al.
Published Web Locationhttp://dx.doi.org/10.2478/v10006-007-0011-6
We address the problem of encoding the state variables of a finite state machine such that the BDD representing the next state function and the output function has the minimum number of nodes. We present an exact algorithm to solve this problem when only the present state variables are encoded. We provide results on MCNC benchmark circuits.
Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.