DocumentCode
1931805
Title
Efficient state assignment framework for asynchronous state graphs
Author
Ykman-Couvreur, Chantal ; Lin, Bill
Author_Institution
IMEC, Leuven, Belgium
fYear
1995
fDate
2-4 Oct 1995
Firstpage
692
Lastpage
697
Abstract
This paper presents a new efficient state assignment framework for synthesizing asynchronous state graphs. This framework operates purely at the state graph level and is applicable to a broad class of behaviors. In this paper we focus the framework for solving the complete state coding problem. This method has been automated and applied to a large set of asynchronous circuits. It achieves significant improvements in terms of both circuit area and computation time
Keywords
asynchronous circuits; encoding; logic design; state assignment; asynchronous circuits; asynchronous state graphs; circuit area; complete state coding problem; computation time; state assignment framework; state graph level; Automata; Circuit synthesis; Environmental management; Flip-flops; Logic design; Memory architecture; Signal design; Signal processing; Signal synthesis;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Design: VLSI in Computers and Processors, 1995. ICCD '95. Proceedings., 1995 IEEE International Conference on
Conference_Location
Austin, TX
ISSN
1063-6404
Print_ISBN
0-8186-7165-3
Type
conf
DOI
10.1109/ICCD.1995.528943
Filename
528943
Link To Document