The Community for Technology Leaders
Green Image
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.
Asynchronous sequential circuits, logical design, next-state and output state equations, sequential circuit synthesis, switching theory.

G. Maki, R. Smith and J. Tracey, "Generation of Design Equations in Asynchronous Sequential Circuits," in IEEE Transactions on Computers, vol. 18, no. , pp. 467-472, 1969.
167 ms
(Ver 3.3 (11022016))