The Community for Technology Leaders
Green Image
Issue No. 04 - April (1971 vol. 20)
ISSN: 0018-9340
pp: 382-391
In this paper, a heuristic state assignment algorithm for asynchronous sequential machines is presented. Machines realized by this assignment scheme will result in circuits having a small amount of gate inputs and operating in single transition time. It is also shown that for a flow table having m<inf>1</inf>input columns, m input variables, and d stable states, the number of gate inputs required
Asynchronous sequential machines, logic circuit realizations, single transition time sequential circuit realizations.
null Chung-Jen Tan, "State Assignments for Asynchronous Sequential Machines", IEEE Transactions on Computers, vol. 20, no. , pp. 382-391, April 1971, doi:10.1109/T-C.1971.223253
92 ms
(Ver 3.3 (11022016))