Issue No. 10 - October (1968 vol. 17)
D.L. Johnson , IEEE
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?Equal-length registers, multiclock operation, sequential machine, shift-register memory, state assignment, transition constraints.
K. O'Keefe and D. Johnson, "The Application of Shift Registers to Secondary State Assignment: Part I," in IEEE Transactions on Computers, vol. 17, no. , pp. 954-965, 1968.