72 search results - page 1 / 15 » A Fully Implicit Algorithm for Exact State Minimization |
DAC
1994
ACM
13 years 8 months ago
1994
ACM
State minimization of incompletely specifiedmachinesis an important step of FSM synthesis. An exact algorithm consists of generation of prime compatibles and solution of a binate ...
ISCAS
2003
IEEE
13 years 10 months ago
2003
IEEE
Ordered Binary Decision Diagrams (BDDs) are frequently used in logic synthesis. In this paper a new exact BDD minimization algorithm is presented, which is based on state space se...
TCAD
1998
13 years 4 months ago
1998
None of the available minimizers for 2-level hazard-free logic minimization can synthesize very large circuits. This limitation has forced researchers to resort to manual and auto...
ICCAD
1997
IEEE
13 years 9 months ago
1997
IEEE
We present a novel method for state minimization of incompletely-specified finite state machines. Where classic methods simply minimize the number of states, ours directly addre...
ASYNC
2001
IEEE
13 years 8 months ago
2001
IEEE
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...