Sciweavers

10 search results - page 1 / 2
» BDD Variable Ordering for Interacting Finite State Machines
Sort
View
DAC
1994
ACM
13 years 8 months ago
BDD Variable Ordering for Interacting Finite State Machines
We address the problem of obtaining good variable orderings for the BDD representation of a system of interacting finite state machines (FSMs). Orderings are derived from the comm...
Adnan Aziz, Serdar Tasiran, Robert K. Brayton
ICML
2005
IEEE
14 years 5 months ago
Recognition and reproduction of gestures using a probabilistic framework combining PCA, ICA and HMM
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
Sylvain Calinon, Aude Billard
GLVLSI
2002
IEEE
95views VLSI» more  GLVLSI 2002»
13 years 9 months ago
Term ordering problem on MDG
As an efficient representation of Extended Finite State Machines, Multiway Decision Graphs (MDG) are suitable for automatic hardware verification of Register Transfer Level (RTL) ...
Yi Feng, Eduard Cerny
FPL
1999
Springer
147views Hardware» more  FPL 1999»
13 years 8 months ago
Synthia: Synthesis of Interacting Automata Targeting LUT-based FPGAs
This paper details the development, implementation, and results of Synthia, a system for the synthesis of Finite State Machines (FSMs) to field-programmable logic. Our approach us...
George A. Constantinides, Peter Y. K. Cheung, Wayn...
DAC
2009
ACM
14 years 5 months ago
Generating test programs to cover pipeline interactions
Functional validation of a processor design through execution of a suite of test programs is common industrial practice. In this paper, we develop a high-level architectural speci...
Thanh Nga Dang, Abhik Roychoudhury, Tulika Mitra, ...