An Iterative Improvement Method for State Minimization of Incompletely Specified Finite State Machines (Special Issue on Synthesis and Verification of Hardware Design)
スポンサーリンク
概要
- 論文の詳細を見る
This paper proposes a heuristic algorithm for state minimization of incompletely specified finite state machines (FSMs). The strategy is similar to that in ESPRESSO, a well-known heuristic algorithm for two-level logic minimization. It consists of generating an initial solution, the set of maximal compatibles, and attempting to apply a series of transformations to the solution. The main transformation is to reduce each compatible in the solution and delete unnecessary compatibles by iterative improvements. Other transformations, such as expansion and merging of compatibles, are also introduced for further reduction. When the number of compatibles is likely to be too large to handle explicitly, they are represented by a Binary Decision Diagram. Experimental results show that the proposed method finds better solutions in shorter CPU times for most of the examples than conventional methods.
- 一般社団法人電子情報通信学会の論文
- 1997-10-25
著者
関連論文
- Phase Optimization in Technology Mapping
- Enhanced Unique Sensitization for Efficient Test Generation (Special Issue on Synthesis and Verification of Hardware Design)
- Robust Heuristics for Multi-Level Logic Simplification Considering Local Circuit Structure (Special Section on VLSI Design and CAD Algorithms)
- Multi-Cycle Path Detection for Sequential Circuits and Its Application to Real Designs
- An Iterative Improvement Method for State Minimization of Incompletely Specified Finite State Machines (Special Issue on Synthesis and Verification of Hardware Design)
- A New Algorithm for Boolean Matching Utilizing Structural Information : PAPER Special Issue on Synthesis and Verification of Hardware Design
- MINT-An Exact Algorithm for Finding Minimum Test Set (Special Section on VLSI Design and CAD Algorithms)