Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Design of Asynchronous Sequential Networks Using Read-Only Memories
IEEE Transactions on Computers
Universal Logic Modules and Their Applications
IEEE Transactions on Computers
Simplified Decomposition of Boolean Functions
IEEE Transactions on Computers
Universal logic circuits and their modular realizations
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
| Hi-index | 14.98 |
The paper discusses the properties of universal logic modules and introduces their use for sequential machine implementation. Expressions for the maximum number of modules required to realize a given function are given. The decomposition technique is shown to be relevant to a modular realization and is a powerful tool in reducing the total number of modules required. Limits on the state splitting technique used in the search for a decomposable system are discussed. Lagrange's method of undetermined multipliers was used to find a minimized implementation based on the distribution of the state variables among the components in serial and parallel decompositions. The results are illustrated by means of examples.