Journal ArticleDOI
On the State Assignment Problem for Sequential Machines II
TLDR
In this paper, the problem of determining economical state assignments for finite-state sequential machines is studied and it is shown that for a sequential machine the existence of assignments with reduced dependence is very closely connected with theexistence of partitions with the substitution property on the set of states of the machine.Abstract:
In this paper, the problem of determining economical state assignments for finite-state sequential machines is studied. The fundamental idea in this study is to find methods for selection of these assignments in which each binary variable describing the new state depends on as few variables of the old state as possible. In general, these variable assignments in which the dependence is reduced yield more economical implementation for the sequential machine than the assignments in which the dependence is not reduced. The main tool used in this study is the partition with the substitution property on the set of states of a sequential machine. It is shown that for a sequential machine the existence of assignments with reduced dependence is very closely connected with the existence of partitions with the substitution property on the set of states of the machine. It is shown how to determine these partitions for a given sequential machine and how they can be used to obtain assignments with reduced dependence.read more
Citations
More filters
Journal ArticleDOI
A Corner-Finding Algorithm for Chain-Coded Curves
TL;DR: A method for detecting sharp "corners" in a chain-coded plane curve is described and a measure for the prominence ("cornerity") of a corner is introduced.
Journal ArticleDOI
Optimal State Assignment for Finite State Machines
TL;DR: The proposed algorithm for optimal state assignment is based on an innovative strategy: logic minimization of the combinational component of the finite state machine is applied before state encoding, and has been coded in a computer program, KISS, and tested on several examples of finite state machines.
Journal ArticleDOI
NOVA: state assignment of finite state machines for optimal two-level logic implementation
TL;DR: The problem of encoding the states of a synchronous finite state machine so that the area of a two-level implementation of the combinational logic is minimized is addressed using algorithms based on a novel theoretical framework that offers advantages over previous approaches to develop effective heuristics.
Proceedings ArticleDOI
NOVA: State Assignment of Finite State Machines for Optimal Two-Level Logic Implementations
TL;DR: This paper presents algorithms for their solution to the problem of encoding the states of a synchronous Finite State Machine so that the area of a two-level implementation of the combinational logic is minimized, based on a new theoretical framework that offers advantages over previous approaches to develop effective heuristics.
Journal ArticleDOI
A Programmed Algorithm for Assigning Internal Codes to Sequential Machines
TL;DR: A relatively fast procedure for assigning codes to the internal states of a sequential machine is described, which leads to a reasonably economical logical realization of the machine in many cases.
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
The synthesis of sequential switching circuits
TL;DR: In this article, an orderly procedure is developed by which the requirements of a sequential switching circuit (one with memory) can be reduced to requirements of several combinational switching circuits (those without memory).
Journal ArticleDOI
Symbolic Analysis of a Decomposition of Information Processing Machines
TL;DR: This paper studies the problem of replacing (decomposing) a complex finite state sequential machine by several simpler ones which operate in parallel and yield the same result.
Journal ArticleDOI
A Note on the Number of Internal Variable Assignments for Sequential Switching Circuits
Edward J. McCluskey,S. H. Unger +1 more
TL;DR: An important step in the synthesis of sequential switching circuits is the assignment of binary variable states to represent internal states of the circuit, and a formula is derived here which indicates the number of different assignments which can be made for flow tables having a given number of rows.