This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tan-Like State Assignments ror Synchronous Sequential Machines
February 1973 (vol. 22 no. 2)
pp. 181-187
H.A. Curtis, International Radiant Corporation
Recently, Tan developed a heuristic state assignment algorithm for asynchronous sequential machines. In this paper a state assignment algorithm based on Tan's is developed for synchronous sequential machines. It shares with Tan's algorithm the advantages of simplicity of execution and economy of logic elements in the resulting realizations.
Index Terms:
Logic circuit realizations, state assignment algorithms, synchronous sequential machines.
Citation:
H.A. Curtis, "Tan-Like State Assignments ror Synchronous Sequential Machines," IEEE Transactions on Computers, vol. 22, no. 2, pp. 181-187, Feb. 1973, doi:10.1109/T-C.1973.223682
Usage of this product signifies your acceptance of the Terms of Use.