Thumbnail
Access Restriction
Subscribed

Author Mowle, Frederic J.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1967
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
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 $(2\textit{n}$ - $\textit{n}$ - 1 $\textit{w})$ stable feedback shift registers of order $\textit{n}$ with Hamming weight equal to $\textit{w}.$ Using this relationship, a recursive algorithm is established which will generate all stable feedback shift registers of order $\textit{n}.$ Formulas are also given for determining the number of stable feedback shift registers which have $\textit{j}$ + 1 starting states and $\textit{j}$ + 1 branch states, 0 ≤ $\textit{j}$ ≤ $2\textit{n}-1$ - 1.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1967-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 14
Issue Number 3
Page Count 14
Starting Page 529
Ending Page 542


Open content in new tab

   Open content in new tab
Source: ACM Digital Library