DocumentCode :
2999626
Title :
Symbolic hazard-free minimization and encoding of asynchronous finite state machines
Author :
Fuhrer, R.M. ; Lin, B. ; Nowick, S.M.
Author_Institution :
Dept. of Comput. Sci., Columbia Univ., New York, NY, USA
fYear :
1995
fDate :
5-9 Nov. 1995
Firstpage :
604
Lastpage :
611
Abstract :
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.
Keywords :
finite state machines; hazards and race conditions; logic CAD; logic design; asynchronous finite state machines; encoding; hazard-free; input encoding; minimization; multiple-input-change; race-free; state codes; Automata; Computer science; Design optimization; Encoding; Hazards; Logic design; Microwave integrated circuits; Minimization; Multivalued logic; Synchronous machines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer-Aided Design, 1995. ICCAD-95. Digest of Technical Papers., 1995 IEEE/ACM International Conference on
Conference_Location :
San Jose, CA, USA
ISSN :
1092-3152
Print_ISBN :
0-8186-8200-0
Type :
conf
DOI :
10.1109/ICCAD.1995.480191
Filename :
480191
Link To Document :
بازگشت