This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
April 1968 (vol. 17 no. 4)
pp. 312-324
Abstract?The problem of determining secondary state assignments for sequential machines such that the binary memory elements are connected in the form of shift registers is studied. An algorithm for finding such state assignments is developed. One or more code words may be assigned to a state of the sequential machine. The only restriction is that the realizations be unitary. A single shift-register realization of a sequential machine is unitary if and only if all the code words assigned to a state have the same first digits. A multiple shift-register realization of a sequential machine is unitary if and only if all the code words assigned to a state have l identical digits, where l is the number of shift registers in the realization. With our technique, the unitary realizations with the minimum number of shift registers can be obtained for any finite, deterministic, synchronous, and reduced (minimal-state) sequential machine, each of whose states has a nonempty predecessor set. The algorithm is suitable for programming on digital computers.
Index Terms:
Index terms?Algorithms, many-to-one state assignments, se-quential machines, shift-register realizations, unitary coding.
Citation:
C.C. Su, S.S. Yau, "Unitary Shift-Register Realizations of Sequential Machines," IEEE Transactions on Computers, vol. 17, no. 4, pp. 312-324, April 1968, doi:10.1109/TC.1968.229383
Usage of this product signifies your acceptance of the Terms of Use.