Wed Nov 7 19:58:48 EST 2012
2 forms of LFSRs
shifts IN a bit based on the XOR of a pattern
Galois: a direct implementation of multiplication by x to produce a
sequence 1,x,x^2, ... modulo p(x)
take the bit that shifts out and use to contidionally XOR the lower
coefficients of the polynomial with the state vector (Used in
The former is a Fibonacci LFSR, while the latter is a Galois LFSR.
Both are easy in hardware, but the latter is easy in software due to
the availability of a "conditional parallel XOR".