how to compare two number sequences
From: FC (fcarpio_at_NOJUNKcomcast.net)
Date: 03/04/05
- Next message: Jerry Coffin: "Re: UnOverRideable member functions?"
- Previous message: Michael P. O'Connor: "UnOverRideable member functions?"
- Next in thread: David Harmon: "Re: how to compare two number sequences"
- Reply: David Harmon: "Re: how to compare two number sequences"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Fri, 04 Mar 2005 00:40:05 -0500
Hi all:
I have two 32 bit long sequence of binary random numbers. When I compare
them side by side I want to count all the transitions from one to zero,
and all the transitions from zero to one between the two sequences like
this:
01100110101010011010101010011001
00110110111001100101010111010101
v ^ ^ v^^vv^v^v^v^ ^ v^
Where v is when it goes low from the first to the second sequence and ^
when it goes high.
So far I have implemented an xor and I can count all the transitions but
I cannot tell them apart (between high and low). Is there a function or
a method that will allow me to tell them apart? If I could do this in
one pass will be even better. Thanks in advance.
- Next message: Jerry Coffin: "Re: UnOverRideable member functions?"
- Previous message: Michael P. O'Connor: "UnOverRideable member functions?"
- Next in thread: David Harmon: "Re: how to compare two number sequences"
- Reply: David Harmon: "Re: how to compare two number sequences"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|
