ITERATIVE NETWORK REALIZATION OF SEQUENTIAL MACHINES.
Abstract
This research is concerned with the problem of realizing the state transition behavior of sequential machines with iterative networks. The problem is viewed as a special type of state assignment problem. Unlike most of the previous research on this problem, which has attempted to find minimal realizations, the goal, in this case, is to obtain realizations which display a high degree of uniformity. The approach to the problem is to first define a class of cellular networks, which have the required uniformity, and then to develop coordinate assignment techniques which give rise to networks in this class. It is shown how cellular networks can be classified by interconnection structure and cell type. The networks of interest are then informally characterized in terms of these classifications. The problem of realizing a sequential machine with a binary network (i.e. an iterative network in which the output terminal of any cell can take on only two distinct values) is also studied. It is shown how the assignment procedure can be extended to produce networks of this type. In this case, the construction may be quite inefficient for certain machines. However, it is shown that the procedure can be modified to produce more efficient binary realizations for the class of autonomous machines and the class of total automata. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Sep 01, 1968
- Accession Number
- AD0676075
Entities
People
- J. Robert Jump
Organizations
- University of Michigan