H. Allen Curtis
- 1 HartMAN J. Symbolic analtysis of a decomposition of information processing maw chines. Inform. and Contr. 8 (Jun.e 1960), 154-178.Google Scholar
- 2 ----. 0n the sate assignment problem for sequential machines t. IRE Trans. EC-IO (June 1961, 157-165.Google Scholar
- 3 STraRss, R. E,.and HarTmans, J. On the state assignment problem for sequential machiLLes II. lRE Trars. EC-IO (Dee. 1961), 593-603.Google Scholar
- 4 HatrTANIS J. Loop-free structure of sequential machines. Information and ControlGoogle Scholar
- 5 ----. Maximal autonomous clocks of sequential machines. IRE Trans. EC-11 (Feb. 1962).Google Scholar
- 6 CurTIS, H. A. Multiple reduction of variable dependency of sequential machines. J. ACM : (1962), 324-344. Google Scholar
- 7 ASHE-tVnS R. L. The decomposition of switctling unctions. Proc. Internat. Symposium on the Theory f Switching (1959).Google Scholar
- 8 CURTIS, H.A. A New Approach to the Design of Switching Circuits, 466-500. D. Van Nostrand Co., Inc., Princeton (1962).Google Scholar
- 9 ----. A generalized tree eireit. J, ACM 8 (1961), 484-496. Google Scholar
- 10 __ A functional canonical form. J. ACM 6 (I959), 245-258. Google Scholar
Index Terms
- Use of Decomposition Theory in the Solution of the State Assignment Problem of Sequential Machines
Recommendations
General decomposition of sequential machines: relationships to state assignment
DAC '89: Proceedings of the 26th ACM/IEEE Design Automation ConferenceIn this paper, we present new techniques for state assignment of finite state machines based on state machine decomposition algorithms.
A finite state machine can be decomposed into smaller interacting machines so as to optimize area and performance of ...
Decomposition and factorization of sequential finite state machines
Algorithms are proposed for decomposing a finite-state machine into smaller interacting machines so as to optimize area and performance of the eventual logic implementation. Cascade decomposition algorithms, which decompose a given machine into ...
Algorithms for the optimal state assignment of asynchronous state machines
ARVLSI '95: Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI'95)This paper presents a method for the optimal state assignment of asynchronous state machines. Unlike state assignment for synchronous state machines, state codes must be chosen carefully to ensure the avoidance of critical races and logic hazards. Two ...
Comments