-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

> At 12:57 PM 8/13/02 -0700, Brendan wrote:
> >Ok, that's what confused me.  6 is 110 in binary.  I guess that
> >was just a typo.
>
> Oops!
>
> >Thx alot.  When I have PIC code for this, I will post it. (I'm
> >just afraid of the 32*8 multiply. I'll be using a code generator
> >for that one :o)
>
> How many bytes you use depends on how long you want the run length
> and the resolution to be. Perhaps a 2-byte unsigned integer would
> be enough.
>
> Multiplying by 6 is fairly easy: 6D = 110B (as you noted). So just
> shift k left once and twice and add the two together to carry out
> the multiply by 6.

Actually, it looks like I won't be coding this after all.  I ran a
bit of a longer test, and determined that I could predict the
sequence of numbers quite effectively, so, I am afraid that it does
have slightly higher autocorrelations than you expected.

The common sequence went 4361 or 4352 or 5261.  It was pretty simple
to guess which it would be, and I was rarely wrong, so I don't think
that this will work.  Have a look at Mike's post, and my reply.
These are far more effective systems that are based on a randomized
source, and therefore have low autocorrelations as long as the random
source is good.  The advantage is simply that they autocorrect for
the biases of the source.

- --Brendan

-----BEGIN PGP SIGNATURE-----
Version: PGPfreeware 6.5.8 for non-commercial use <http://www.pgp.com>

iQA/AwUBPVqDSQVk8xtQuK+BEQJ2KwCeIcPY8wQTXXz0PMLgqSX8H9dG0PsAn3Ry
o/sm3nlu/kGGYSYvTQdza0wG
=0LFS
-----END PGP SIGNATURE-----

--
http://www.piclist.com hint: To leave the PICList
mailto:piclist-unsubscribe-request@mitvma.mit.edu