Subscribe
Issue No.09 - September (1969 vol.18)
pp: 824-829
F.J. Mowle , IEEE
ABSTRACT
Two vector operators ? and ? are introduced. The next-state operator ? allows one to calculate the successors of a set of states {G} from a binary nonlinear feedback shift register. The past-state operator ? allows one to calculate the predecessors of a set of states {G}. Both of these operators, which can be easily programmed on a digital computer, can be used to analyze autonomous and nonautonomous feedback shift registers. Analysis procedures using these operators are given for determining the cycle set of an arbitrary nonlinear FSR, for deciding if the state diagrams of the FSR are connected or strongly connected, and also for determining if the FSR is controllable.
INDEX TERMS
Connectedness, controllability of FSR's, cycle sets, feedback shift registers, sequential machines, stability of FSR's, strong connectedness.
CITATION
F.J. Mowle, "Readily Programmable Procedures for the Analysis of Nonlinear Feedback Shift Registers", IEEE Transactions on Computers, vol.18, no. 9, pp. 824-829, September 1969, doi:10.1109/T-C.1969.222779