Journal ArticleDOI
Simplification of Incompletely Specified Flow Tables with the Help of Prime Closed Sets
Reads0
Chats0
TLDR
It has been shown that these prime closed sets in sequential circuit synthesis play an analogous role to that of the prime implicants in combinational circuit synthesis.Abstract:
In this short note, an attempt has been made to arrive at a general algorithm for minimizing the number of internal states in an incompletely specified flow table. The closure property of the compatibility classes which cover a given flow table leads us to the derivation of a particular class of closed sets defined as irredundant prime closed sets. It has been shown that these prime closed sets in sequential circuit synthesis play an analogous role to that of the prime implicants in combinational circuit synthesis. A method has been described for determining all the irredundant prime closed sets and finding the minimal row flow table by suitably choosing one or a collection of those sets.read more
Citations
More filters
Journal ArticleDOI
Exact and heuristic algorithms for the minimization of incompletely specified state machines
TL;DR: The results prove that exact state minimization is feasible for a large class of practical examples, certainly including most hand-designed FSM's, and argues that the true objective of state reduction should be reduction toward maximal encodability.
Journal ArticleDOI
On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
TL;DR: The problem involving the compatibility relation in a broader perspective is considered and a new approach for finding aU the modified cut-sets of the incompatibility graph of a set having a compatibility relation between its different pairs of elements is suggested.
Proceedings ArticleDOI
Exact and heuristic algorithms for the minimization of incompletely specified state machines
TL;DR: The authors' results prove that exact state minimization is feasible for a large class of practical examples, certainly including most hand-designed FSM's, and argue that the true objective of state reduction should be reduction toward maximal encodability.
Journal ArticleDOI
Explicit and implicit algorithms for binate covering problems
TL;DR: This work surveys techniques for solving binate covering problems, an optimization step often occurring in logic synthesis applications, and shows how table reductions, computation of a lower bound, and of a branching column can be performed on the table so represented.
Journal ArticleDOI
State Minimization of Incompletely Specified Sequential Machines
C.V.S. Rao,Nripendra N. Biswas +1 more
TL;DR: A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented and the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived is introduced.
References
More filters
Journal ArticleDOI
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
M. C. Paull,S. H. Unger +1 more
TL;DR: A partially enumerative solution to the problem of reducing the number of rows in a flow table in which some of the entries are unspecified is presented and a rough indication of the efficiency of the given procedures is obtained.
Journal ArticleDOI
A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
A. Grasselli,Fabrizio Luccio +1 more
TL;DR: A method is illustrated for minimizing the number of internal states in incompletely specified sequential networks and it is shown that only some compatibility classes (prime compatibility classes) need be considered as members of a solution.
Journal ArticleDOI
Minimum-state sequential circuits for a restricted class of incompletely specified flow tables
TL;DR: In this paper, the problem of obtaining minimum-state sequential circuits for incompletely specified flow tables is addressed, where the only unspecified entries are those which occur because of restrictions on the allowed input-variable changes.
Related Papers (5)
A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
A. Grasselli,Fabrizio Luccio +1 more
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
M. C. Paull,S. H. Unger +1 more