Sciweavers

Share
ICCAD
1999
IEEE

OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic

9 years 2 months ago
OPTIMISTA: state minimization of asynchronous FSMs for optimum output logic
The optimal state minimization problem is to select a reduced state machine having the best logic implementation over all possible state reductions and encodings. A recent algorithm, OPTIMIST [3], was the first general solution to this problem for synchronous FSMs. In this paper, we present the first solution for asynchronous FSMs. This paper makes two contributions. First, we introduce OPTIMISTA, a new algorithm which guarantees optimum 2-level output logic for asynchronous FSMs. In asynchronous machines, output logic is often critical: it usually determines the machine latency. The algorithm is formulated as a binate constraint satisfaction problem, which is solved using a binate solver. The second contribution is a novel alternative result: the unreduced machine itself can be used directly to obtain minimum-cardinality output logic. Thus, this paper presents two approaches: using OPTIMISTA, which simultaneously performs state and logic minimization; or using no state reduction (if ...
Robert M. Fuhrer, Steven M. Nowick
Added 03 Aug 2010
Updated 03 Aug 2010
Type Conference
Year 1999
Where ICCAD
Authors Robert M. Fuhrer, Steven M. Nowick
Comments (0)
books