A new state assignment technique for asynchronous finite state machines

Author

Chu, Tam-Anh ; Mani, Narayana ; Leung, Clement K C

Author_Institution

Cirrus Logic Inc., Fremont, CA, USA

fYear

1993

fDate

5-6 Mar 1993

Firstpage

139

Lastpage

143

Abstract

The authors propose an efficient critical race-free state assignment technique for asynchronous finite-state machines under the unbounded gate delay model. Instead of using the Huffman model, it operates on the state graph model, in which all signals are treated uniformly and hazards can be characterized as a violation of the complete state coding (CSC) property. The proposed state assignment technique first detects CSC violations and then eliminates them using a modified greedy graph-coloring heuristic

Keywords

asynchronous sequential logic; delays; finite state machines; graph colouring; hazards and race conditions; logic design; sequential machines; sequential switching; state assignment; CSC violations; Huffman model; asynchronous finite state machines; complete state coding; modified greedy graph-coloring heuristic; race-free state assignment; state graph model; unbounded gate delay model; Automata; Circuit analysis; Circuit synthesis; Delay; Encoding; Hazards; Logic; Output feedback; Signal synthesis; State feedback;

fLanguage

English

Publisher

ieee

Conference_Titel

VLSI, 1993. 'Design Automation of High Performance VLSI Systems', Proceedings., Third Great Lakes Symposium on

Conference_Location

Kalamazoo, MI

Print_ISBN

0-8186-3430-8

Type

conf

DOI

10.1109/GLSV.1993.224462

Filename

224462