Help searching a byte pattern within an array of bytes.

[noend]

I am in need to find a byte pattern within an array of bytes. I am treating
the byte array as an array of bits so the pattern may be or may not be
found within two bytes and at any bit position. Then I need to reassemble
those 8 bits into a byte and output them accordingly via RS232.

What I have wrote to resolve this puzzle is:

[mathewss]

I do not believe this will work well for you if I understand your needs.

In your code you are only looking at your pattern on the byte boundary.

If your pattern exists on 2 bytes ie the lower nibble of byte 4 and the
upper nibble of byte 5 you will miss your pattern.

If you know your pattern will exist on a single byte then you don't need
any of this bit logic you can just check for any byte in table[] that is
equal to BitPattern.

If you need to find that bit pattern at any bit position in your table[] then
you need to throw this away and try again.

I would use a simple state machine. If at any point the bit you are
looking at does not match the bit position in your table you need to
remember to reset your Bitposition back to the first position you had
matching bits + 1 so keep track of position in your bits that you had a
match of 1 bit. As soon as a bit does not match rewind to your first match
+ 1 and start again.


Re
Sean M