High Speed Generation of Maximal Length Sequences

  • Authors:
  • A. Lempel;W. L. Eastman

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1971

Quantified Score

Hi-index 14.99

Visualization

Abstract

The construction described in this note makes possible the generation of any given linear shift register sequence of maximal period p= 2n-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.