High Speed Generation of Maximal Length Sequences

Abstract

The construction described in this note makes possible the generation of any given linear shift register sequence of maximal period p= 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">n</sup> -1, at a rate k times faster than the shift pulse rate. The construction is valid for any positive integer k which is not a multiple of p and it employs at most k linear shift registers of degree n or less.