FSM Encoding for BDD Representations
Open Access
|Apr 2007Abstract
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.
Language: English
Page range: 113 - 124
Published on: Apr 5, 2007
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2007 Wilsin Gosti, Tiziano Villa, Alex Saldanha, Alberto Sangiovanni-Vincentelli, published by University of Zielona Góra
This work is licensed under the Creative Commons License.