Multiple Reduction of Variable Dependency of Sequential Machines
Journal of the ACM (JACM)
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
The Realization of Polylinear Sequential Circuits Using Flip-Flop Memory
IEEE Transactions on Computers
Tan-Like State Assignments ror Synchronous Sequential Machines
IEEE Transactions on Computers
On the Problem of Finding d, t, r, and j Type Partition Pairs of a Sequential Machine
IEEE Transactions on Computers
Realizations of Sequential Machines Using Random Access Memory
IEEE Transactions on Computers
Optimum State Assignment for Synchronous Sequential Circuits
IEEE Transactions on Computers
Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part II
IEEE Transactions on Computers
| Hi-index | 15.00 |
This paper is Part I of a two-part study of systematic procedures for realizing synchronous sequential machines using flip-flop memory. In this study the methods of Dolotta and McCluskey, and Weiner and Smith are generalized so that they can be used to obtain directly good realization of machines using flip-flop memory. In Part I the generalizations are simple, straightforward, and require a minimal amount of changes to the basic methods. For machines using trigger flip-flop memory or a combination of trigger and set-reset, or trigger and J-K flip-flops, these generalizations usually yield significantly better realizations than those obtained from the use of the ungeneralized versions of these methods along with methods for transforming the resulting next-state functions into flip-flop input functions. Minimization of changes of these methods was achieved at the expense of imposing the restriction that the inputs to each of the set-reset and J-K flip-flop types be complementary. In Part II of this study1 further generalizations for obtaining even better realizations using trigger, set-reset, and J-K flip-flops are developed by dropping the aforementioned restriction.