This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Application of Shift Registers to Secondary State Assignment: Part I
October 1968 (vol. 17 no. 10)
pp. 954-965
Abstract?An algorithm, which determines whether or not an arbitrary sequential machine can be realized using a set of equal-length shift registers, is developed. When realization is possible, a basis for state assignment is also given.
Index Terms:
Index Terms?Equal-length registers, multiclock operation, sequential machine, shift-register memory, state assignment, transition constraints.
Citation:
D.L. Johnson, K.H. O'Keefe, "The Application of Shift Registers to Secondary State Assignment: Part I," IEEE Transactions on Computers, vol. 17, no. 10, pp. 954-965, Oct. 1968, doi:10.1109/TC.1968.226441
Usage of this product signifies your acceptance of the Terms of Use.