Issue No. 02 - February (1971 vol. 20)
A. Lempel , IEEE
The construction described in this note makes possible the generation of any given linear shift register sequence of maximal period p= 2<sup>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.
Feedback shift register, maximal-length sequences from linear shift registers, rate multiplication.
A. Lempel, W.L. Eastman, "High Speed Generation of Maximal Length Sequences", IEEE Transactions on Computers, vol. 20, no. , pp. 227-229, February 1971, doi:10.1109/T-C.1971.223220