MULTIPLE SHIFT REGISTER REALIZATIONS OF SEQUENTIAL MACHINES,
Abstract
The study is concerned with the problem of mechanizing synchronous sequential machines with shift registers. It is shown that any machine can be mechanized with shift registers. The determination of the least number of shift registers required in a mechanization of a given machine is investigated. A 20-step algorithm, suitable for programming on a digital computer, is developed which starts with the state table of the given machine and yields mechanizations having the least possible number of shift registers. The application of the algorithm to systems design is considered, and a method is given for decomposing the system, designing each of the submachines, and then combining these designs into a mechanization of the system. In addition, it is demonstrated that the algorithm may be applied to logic systems having three or more values as opposed to the conventional, binary system. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1964
- Accession Number
- AD0608155
Entities
People
- A. J. Nichols Iii.
Organizations
- Lockheed Martin Missiles and Space