Update for 15-12-21 14:45
This commit is contained in:
parent
b1953bf0ae
commit
f6c12a1e80
@ -11,6 +11,10 @@ The maximum period for a _n_ bit shift register is
|
|||||||
|
|
||||||
2^n - 1
|
2^n - 1
|
||||||
|
|
||||||
|
An LFSR can be generalized as a recurrence relationship where
|
||||||
|
- The preceding terms are not raised to a power
|
||||||
|
- There are no added constants
|
||||||
|
|
||||||
A *tap* is where a bit is read and fed back into itself.
|
A *tap* is where a bit is read and fed back into itself.
|
||||||
|
|
||||||
== Reverse Engineering ==
|
== Reverse Engineering ==
|
||||||
|
Loading…
Reference in New Issue
Block a user