An Algorithm for Generating Stable Feedback Shift Registers of Order n

  • Authors:

  • Frederic J. Mowle

  • Affiliations:

  • Purdue University, Lafayette, Indiana

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1967

Quantified Score

Hi-index 0.06

Visualization

Abstract

It is shown in this paper that the stable feedback shift registers, when classified according to Hamming weight (the number of fundamental product terms in expanded sum of products form), are binomially distributed, i.e., are (2n - n - 1 w) stable feedback shift registers of order n with Hamming weight equal to w. Using this relationship, a recursive algorithm is established which will generate all stable feedback shift registers of order n. Formulas are also given for determining the number of stable feedback shift registers which have j + 1 starting states and j + 1 branch states, 0 ≤ j ≤ 2n-1 - 1.