On Tue, 30 Jan 2007 15:31:09 -0800
Carl Love <[email protected]> wrote:
> An LFSR sequence is similar to a pseudo random number sequence. For a 24
> bit LFSR sequence each number between 0 and 2^24 will occur once in the
> sequence but not in a normal counting order. The hardware uses the LFSR
> sequence to count to since it is much simpler to implement in hardware
> then a normal counter. Unfortunately, the only way we know how to
> figure out what the LFSR value that corresponds to the number in the
> sequence that is N before the last value (0xFFFFFF) is to calculate the
> previous value N times. It is like trying to ask what is the pseudo
> random number that is N before this pseudo random number?
That should be no problem.
You can just revers your algorithm and let it run x times instead of 0xFFFFFF-x.
>
> I will add a short comment to the code that will summarize the above
> paragraph.
> [snip]
>
> _______________________________________________
> cbe-oss-dev mailing list
> [email protected]
> https://ozlabs.org/mailman/listinfo/cbe-oss-dev
--
Mit freundlichen Grüssen,
kind regards,
Christian Krafft
IBM Systems & Technology Group,
Linux Kernel Development
IT Specialist
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [email protected]
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/
[Index of Archives]
[Kernel Newbies]
[Netfilter]
[Bugtraq]
[Photo]
[Stuff]
[Gimp]
[Yosemite News]
[MIPS Linux]
[ARM Linux]
[Linux Security]
[Linux RAID]
[Video 4 Linux]
[Linux for the blind]
[Linux Resources]
