State Assignments for Asynchronous Sequential Machines
- 1 April 1971
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-20 (4) , 382-391
- https://doi.org/10.1109/t-c.1971.223253
Abstract
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 m1input columns, m input variables, and d stable states, the number of gate inputs required for a single transition time realization is bounded by d(m1+m+1).Keywords
This publication has 6 references indexed in Scilit:
- Structural Simplification and Decomposition of Asynchronous Sequential CircuitsIEEE Transactions on Computers, 1969
- Generation of Design Equations in Asynchronous Sequential CircuitsIEEE Transactions on Computers, 1969
- A Note on State Minimization of Asynchronous Sequential FunctionsIEEE Transactions on Electronic Computers, 1967
- Internal State Assignments for Asynchronous Sequential MachinesIEEE Transactions on Electronic Computers, 1966
- A State Variable Assignment Method for Asynchronous Sequential Switching CircuitsJournal of the ACM, 1963
- The synthesis of sequential switching circuitsJournal of the Franklin Institute, 1954