Clay <[email protected]> wrote:

>On Jul 4, 12:55*am, Nicholas Kinar <n.ki...@usask.ca> wrote:

>> I am trying to generate a Maximum Length Sequence (MLS) using a Linear
>> Feedback Shift Register (LFSR).

>When I think about generating a MAXIMUM length sequence, I woudn't
>even consider something so short as just 4095 states before repeating.
>I often use a Mersenne Twister, which has a period of 2^19937. Yes
>that's correct. And it is easy to implement and free code exist on the
>web for it.

Turns out that engineering requirements come in all forms
and sometimes you do not want, or cannot use, the more
elaborate solution.

For example, with a maximal-length sequence formed from a
polynomial over GF(2), it's often practical to jump to
a prescribed point in the middle of the sequence, or to
examine the register contents and figure out where you
are in the sequence. Can a Mersenne twister do that?

Steve