Proceedings ArticleDOI
Decomposition of sequential machines
Z. Kohavi,E. J. Smith +1 more
- pp 52-61
TLDR
This paper examines the problem of finding cascade decompositions for two or.Abstract:
This paper examines the problem of finding cascade decompositions for two or more reduced sequential machines which have the same input, such that a common submachine may be factored out and serve as a predecessor machine feeding two or more successor machines which generate the outputs of the specified given machines Necessary and sufficient conditions under which it is possible to obtain decompositions which contain such a common submachine are developed If the given machines do not satisfy these conditions, and a common submachine cannot be found, it is shown how one or both of the machines can be replaced by equivalent machines in such a way that some common submachine can be found The basic tool in the determination of the common submachine is the implication table which is constructed from the implication graph The objective of the cascade decomposition is to obtain, where possible, an economical realization in terms of internal memory elements without sacrificing economy in the complexity of the output logic circuitryread more
Citations
More filters
Journal ArticleDOI
Structural Simplification and Decomposition of Asynchronous Sequential Circuits
TL;DR: This paper extends the partition theory developed by Hartmanis and Stearns for synchronous sequential circuits to asynchronous sequential circuits and utilizes the concept of partition pairs to obtain single transition time asynchronous state assignments with reduced dependence.
Proceedings ArticleDOI
Structural simplification and decomposition of asynchronous sequential circuits
TL;DR: This paper extends the partition theory developed by Hartmanis and Stearns for synchronous sequential circuits to asynchronous sequential circuits and utilizes the concept of partition pairs to obtain single transition time asynchronous state assignments with reduced dependence.
Proceedings ArticleDOI
Synthesis of multiple sequential machines
Edward J. Smith,Zvi Kohavi +1 more
TL;DR: It is shown that a minimal-state machine realization can always be obtained in a completely systematic way, such that the state-variable and output variable dependencies are reduced simultaneously.
Posted Content
Modular Decomposition of Hierarchical Finite State Machines.
TL;DR: In this paper, a decomposition tree is proposed to identify hierarchical finite state machines (HFSMs) equivalent to a given finite state machine (FSM) in automata theory.
Journal ArticleDOI
Reduction of Output Dependency in Sequential Machines
TL;DR: The concept of partially independent subsets is seen to apply to machines which do not possess any partitions with substitution property or partition pairs and is used as a tool for obtaining simpler secondary assignments as well as simpler output circuits.
References
More filters
Journal ArticleDOI
A method for synthesizing sequential circuits
TL;DR: A new method of synthesis is developed which emphasizes formal procedures rather than the more familiar intuitive ones, and familiarity is assumed with the use of switching algebra in the synthesis of combinational circuits.
Journal ArticleDOI
Loop-free structure of sequential machines
TL;DR: It is shown how the amount of information flowing between the component machines in a realization can be studied by means of partition pairs.
Journal ArticleDOI
The Cascade Decomposition of Sequential Machines
TL;DR: This paper studies composite sequential machines obtained from smaller component machines by their connection in cascade, that is, the outputs from one component are the inputs to the next.
Journal ArticleDOI
Secondary State Assignment for Sequential Machines
TL;DR: This paper presents a method of obtaining for any given machine M an equivalent machine M?