GENERAL SHIFT-REGISTER SEQUENCE GENERATORS,
Abstract
The paper examines the theory of design of shift-register sequence generators capable of creating non-repeating sequences longer than obtained by the classical linear or nonlinear shift-register sequence generators. This capability is achieved by cyclically modifying the effective connections in the feedback loop. A description of the behavior of k-stage shift-register sequence generators in terms of cyclic transformations on the state space X sub k of a generator is introduced and used to analyze the behavior of a model of the general k-stage shift-register sequence generator. The latter is capable of producing sequences of maximal period of m2 to the kth power by cyclic application of m transformations. Various classes of suitable transformations are described, and use of 'cycle graphs' for choosing sets of transformations to generate sequences of desired periods is proposed as a tool for synthesizing logics for the general shift-register sequence generator. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Nov 01, 1966
- Accession Number
- AD0642347
Entities
People
- I. S. Reed
- Rein Turn
Organizations
- RAND Corporation