DocumentCode :
1105495
Title :
State Assignment Selection in Asynchronous Sequential Circuits
Author :
Maki, Gary K. ; Tracey, James H.
Author_Institution :
IEEE
Issue :
7
fYear :
1970
fDate :
7/1/1970 12:00:00 AM
Firstpage :
641
Lastpage :
644
Abstract :
Methods already exist for the construction of critical race-free assignments for asynchronous sequential circuits. Some of these methods permit the construction of many assignments for the same flow table. The algorithm presented here consists of two easy to apply tests which select that critical race-free assignment most likely to produce a set of simple next-state equations. The algorithm has been programmed.
Keywords :
Asynchronous sequential circuits, sequential circuit synthesis, sequential machines, state assignment.; Circuit synthesis; Circuit testing; Equations; Sequential circuits; Asynchronous sequential circuits, sequential circuit synthesis, sequential machines, state assignment.;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/T-C.1970.222996
Filename :
1671589
Link To Document :
بازگشت