Academic
Publications
FSM Encoding for BDD Representations
FSM Encoding for BDD Representations   (Citations: 2)
BibTex | RIS | RefWorks Download
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.
Journal: Applied Mathematics and Computer Science , vol. 17, no. 1, pp. 113-124, 2007
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Order by: