# Algorithms for the optimal state assignment of asynchronous state machines

@article{Fuhrer1995AlgorithmsFT, title={Algorithms for the optimal state assignment of asynchronous state machines}, author={Robert M. Fuhrer and Bill Lin and Steven M. Nowick}, journal={Proceedings Sixteenth Conference on Advanced Research in VLSI}, year={1995}, pages={59-75} }

This paper presents a method for the optimal state assignment of asynchronous state machines. Unlike state assignment for synchronous state machines, state codes must be chosen carefully to ensure the avoidance of critical races and logic hazards. Two related problems are considered: (i) optimal critical race-free state assignment; and (ii) optimal hazard-free and critical race-free state assignment for normal fundamental mode machines. Analogous to a paradigm successfully used for the optimal… Expand

#### 8 Citations

Symbolic hazard-free minimization and encoding of asynchronous finite state machines

- Computer Science
- ICCAD
- 1995

This paper formulate and solve an optimal hazard-free and critical race-free encoding problem for a class of MIC asynchronous state machines called burst-mode, and believes this is the first general method for the optimal encoding of hazard- free MIC asynchronousstate machines under a generalized fundamental mode of operation. Expand

Symbolic hazard-free minimization and encoding of asynchronous finite state machines

- Computer Science
- Proceedings of IEEE International Conference on Computer Aided Design (ICCAD)
- 1995

This paper formulate and solve an optimal hazard-free and critical race-free encoding problem for a class of MIC asynchronous state machines called burst-mode, and believes this is the first general method for the optimal encoding of hazard- free MIC asynchronousstate machines under a generalized fundamental mode of operation. Expand

Analysis for Design and Transformation of Autosynchronous State Machines

- Computer Science
- 2010

The design methodology for autosynchronous state machines with one-hot and Gray encodings is designed and the transformation methodology of synchronous state machine in VHDL at RTL level to autos asynchronous state machine is designed. Expand

Autosynchronous circuits design methodology

- Computer Science
- 2009 19th International Conference Radioelektronika
- 2009

This paper refers with autosynchronous state machines from basic parameters and timing properties determination to design methodology description and results are the simulation models of these state machines and their verification. Expand

Sequential optimization of asynchronous and synchronous fintie-state machines

- Computer Science
- 2001

Book of sequential optimization of asynchronous and synchronous finite state machines algorithms and tools 1, as an amazing reference becomes what you need to get. Expand

ANALÝZA MOŽNOSTÍ SIMULÁCIE A IMPLEMENTÁCIE AUTOSYNCHRÓNNYCH SUBSYSTÉMOV V OBVODOCH VLSI

- Computer Science
- 2010

This thesis focuses on problem-solution analysis of synchronous digital circuits; the results are autosynchronous circuit design methodology, timing parameter definitions based on simulation models and constraint settings, and a theoretical comparison of several types of synchronization. Expand

The formal verification of a pipelined double-precision IEEE floating-point multiplier

- Computer Science
- ICCAD
- 1995

This paper presents the formal verification of a radix-eight, pipelined, IEEE double-precision floating-point multiplier using a mixture of model-checking and theorem-proving techniques in the Voss hardware verification system. Expand

A distributed analysis and monitoring framework for the compact Muon solenoid experiment and a pedestrian simulation

- Engineering, Computer Science
- 2010

This thesis discusses in detail the major concepts and components required to make parallel and distributed computing a reality, and the origins and fundamentals of Grid computing and the motivations for its use in High Energy Physics. Expand

#### References

SHOWING 1-10 OF 42 REFERENCES

MUSTANG: state assignment of finite state machines targeting multilevel logic implementations

- Computer Science
- IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
- 1988

The authors present state-assignment algorithms that heuristically maximize the number of common cubes in the encoded network to maximize theNumber of literals in the resulting combinational logic network after multilevel logic optimization. Expand

NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations

- Mathematics, Computer Science
- 26th ACM/IEEE Design Automation Conference
- 1989

This paper presents algorithms for their solution to the problem of encoding the states of a synchronous Finite State Machine so that the area of a two-level implementation of the combinational logic is minimized, based on a new theoretical framework that offers advantages over previous approaches to develop effective heuristics. Expand

Optimal State Assignment for Finite State Machines

- Computer Science
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- 1985

The proposed algorithm for optimal state assignment is based on an innovative strategy: logic minimization of the combinational component of the finite state machine is applied before state encoding, and has been coded in a computer program, KISS, and tested on several examples of finite state machines. Expand

NOVA: state assignment of finite state machines for optimal two-level logic implementation

- Mathematics, Computer Science
- IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
- 1990

The problem of encoding the states of a synchronous finite state machine so that the area of a two-level implementation of the combinational logic is minimized is addressed using algorithms based on a novel theoretical framework that offers advantages over previous approaches to develop effective heuristics. Expand

Automatic synthesis of locally-clocked asynchronous state machines

- Computer Science
- 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers
- 1991

A novel automated design methodology for asynchronous state-machine controllers that allows multiple input changes and produces hazard-free designs with a minimal or near-minimal number of states is described. Expand

Internal State Assignments for Asynchronous Sequential Machines

- Computer Science
- IEEE Trans. Electron. Comput.
- 1966

The paper presents three procedures for coding the internal states of asynchronous sequential switching circuits. Resulting codes insure that the circuit will function according to flow table… Expand

State assignment for power and area minimization

- Computer Science
- Proceedings 1994 IEEE International Conference on Computer Design: VLSI in Computers and Processors
- 1994

A new matching-based state-assignment algorithm which considers area and state transitions simultaneously is proposed which is very effective in minimizing both area and power dissipation for finite state machine designs. Expand

Automatic synthesis of burst-mode asynchronous controllers

- Computer Science
- 1993

This thesis presents a new locally-clocked design method for the synthesis of asynchronous controllers which has been automated, is proven correct and produces high-performance implementations which are hazard-free at the gate-level. Expand

Algorithms for synthesis of hazard-free asynchronous circuits

- Computer Science
- 28th ACM/IEEE Design Automation Conference
- 1991

Algorithms for synthesis and hazard removal are given, able to produce hazard-free circuits with the bounded wire-delay model, requiring the STG to be live, safe and to have the unique state coding property. Expand

Synthesis of 3D asynchronous state machines

- Computer Science
- Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors
- 1992

A synthesis procedure for designing asynchronous controllers from burst-mode specifications, a class of specifications allowing multiple-input-change fundamental mode operation, is described, and the state assignment technique is based on the construction of a three-dimensional next-state table. Expand