Published Online: Apr 05, 2007
Page range: 113 - 124
DOI: https://doi.org/10.2478/v10006-007-0011-6
Keywords
This content is open access.
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.