This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
State Assignment Selection in Asynchronous Sequential Circuits
July 1970 (vol. 19 no. 7)
pp. 641-644
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.
Index Terms:
Asynchronous sequential circuits, sequential circuit synthesis, sequential machines, state assignment.
Citation:
G.K. Maki, J.H. Tracey, "State Assignment Selection in Asynchronous Sequential Circuits," IEEE Transactions on Computers, vol. 19, no. 7, pp. 641-644, July 1970, doi:10.1109/T-C.1970.222996
Usage of this product signifies your acceptance of the Terms of Use.