Shift register sequencesHolden-Day, 1967 - 224 pages |
Contents
The Present Status of the Shift Register Art | 2 |
Sequences With Randomness Properties | 24 |
Structural Properties of PN Sequences | 75 |
Copyright | |
27 other sections not shown
Other editions - View all
Common terms and phrases
a₁ Ak-n auto-correlation Boolean functions Bruijn sequences C₁ Chapter characteristic polynomial Combination Cycle Length complementation compute condition Cont'd corresponding Cycle containing Cycle Length Tap cycles of length cyclotomic cosets cyclotomic polynomial decomposition digits divides equation example expected length F₁ feedback logic finite state machine I₁ input sequence integer irreducible polynomials Lemma Length quency Length Tap Combination linear logic linear shift register longest cycle m₁ maximum exponent maximum-length shift register Mersenne prime method modulo multiplicative n-stage shift register node nonlinear shift register number of 1's number of cycles occurs Octal order invariants periods obtained permutation phase shift PN sequences polynomials of degree possible prime Proof properties random recurrence relation roots of unity S₁ Section sequences of degree sequences of length shift register sequences shown in Figure subgroup successor Tap Combination Cycle Tap Cycle Theorem trinomial truth table values variables



