Symbolic hazard-free minimization and encoding of asynchronous finite state machines
Symbolic hazard-free minimization and encoding of asynchronous finite state machines
复制标题
DOI：
10.1109/iccad.1995.480191
复制
发表时间：
1995-12
期刊：
影响因子：
--
通讯作者：
Robert M. Fuhrer;Bill Lin;S. Nowick
中科院分区：
文献类型：
--
作者：
Robert M. Fuhrer;Bill Lin;S. Nowick
本文提出了一种多输入变化（MIC）异步状态机的自动综合方法。异步状态机的设计是微妙的，因为与同步合成不同，逻辑必须在没有危险的情况下实现，并且必须仔细选择状态码以避免关键竞争。我们制定并解决了一个最佳的无风险和关键的无竞争编码问题的一类MIC异步状态机称为突发模式。类似于一个范例成功地用于同步机的最佳编码，制定的问题作为一个输入编码问题。实现的目标是实现产品总和。我们相信，这是第一个通用的方法，用于无风险的MIC异步状态机的最佳编码下的一个广义的基本操作模式。结果表明，改进的解决方案，范围高达17%的改善。
This paper presents an automated method for the synthesis of multiple-input-change (MIC) asynchronous state machines. Asynchronous state machine design is subtle since, unlike synchronous synthesis, logic must be implemented without hazards, and state codes must be chosen carefully to avoid critical races. We formulate and solve an optimal hazard-free and critical race-free encoding problem for a class of MIC asynchronous state machines called burst-mode. Analogous to a paradigm successfully used for the optimal encoding of synchronous machines, the problem is formulated as an input encoding problem. Implementations are targeted to sum-of-product realizations. We believe this is the first general method for the optimal encoding of hazard-free MIC asynchronous state machines under a generalized fundamental mode of operation. Results indicate that improved solutions are produced, ranging up to 17% improvement.