Analysis of an Algorithm Used in Nonlinear Binary Sequence Generators

摘要

Cycles or periods of any length from one to 2 to the nth power can be obtained from a particular type of nonlinear shift register generator where n is the number of stages in the register. An algorithm exists which can be used to determine the initial state and feedback required to obtain a particular period. This algorithm has certain limitations which restrict its use, but by use of factors resulting from the shift and add property of a related linear shift register generator, these limitations can be overcome. This thesis provides a mathematical analysis of the algorithm and touches on some related problems. (Author)