This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generation of Design Equations in Asynchronous Sequential Circuits
May 1969 (vol. 18 no. 5)
pp. 467-472
One step in the synthesis procedure for realizing an asynchronous sequential switching circuit is the generation of next-state and output state equations from a simplified and coded flow table description of the circuit. The usual approach for determining these equations is to first construct a state table from the coded flow table, and then construct transition and output tables. For large flow tables this can be quite a lengthy procedure. This note describes an algorithm which simplifies the synthesis procedure for normal fundamental-mode circuits by permitting the determination of these equations without explicit construction of the state table, transition table, or output table. The algorithm has been programmed in PL/1.
Index Terms:
Asynchronous sequential circuits, logical design, next-state and output state equations, sequential circuit synthesis, switching theory.
Citation:
G.K. Maki, J.H. Tracey, R.J. Smith, "Generation of Design Equations in Asynchronous Sequential Circuits," IEEE Transactions on Computers, vol. 18, no. 5, pp. 467-472, May 1969, doi:10.1109/T-C.1969.222688
Usage of this product signifies your acceptance of the Terms of Use.