DocumentCode
910809
Title
The distribution of (n-m) terms for maximal length linear pseudo-random sequences (Corresp.)
Author
Braasch, R.
Volume
14
Issue
4
fYear
1968
fDate
7/1/1968 12:00:00 AM
Firstpage
607
Lastpage
608
Abstract
The number of
terms as a function of the length between their recurrence is derived for maximal length linear
-stage shift-register generated sequences. An
term is defined as that state remaining following specification of
components, of the
component shift-register state, as "don\´t care" variables. The derivation makes application of the cycle-and-add property for such sequences. The distribution is shown to be of value
for all recurrence lengths less than the period of the sequence and of value
when the recurrence length is equal to the period of the sequence. [1] In addition, it is concluded that the distribution of
terms for de Bruijn sequences (maximal-length nonlinear recursions) is dependent upon
term construction.
terms as a function of the length between their recurrence is derived for maximal length linear
-stage shift-register generated sequences. An
term is defined as that state remaining following specification of
components, of the
component shift-register state, as "don\´t care" variables. The derivation makes application of the cycle-and-add property for such sequences. The distribution is shown to be of value
for all recurrence lengths less than the period of the sequence and of value
when the recurrence length is equal to the period of the sequence. [1] In addition, it is concluded that the distribution of
terms for de Bruijn sequences (maximal-length nonlinear recursions) is dependent upon
term construction.Keywords
Pseudonoise sequences; Binary sequences; Character generation; Galois fields; Logic; Polynomials; Shift registers; State feedback; Vectors;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1968.1054172
Filename
1054172
Link To Document