Re: bit operations and parity
- From: Eric Sosman <Eric.Sosman@xxxxxxx>
- Date: Wed, 29 Jul 2009 16:26:39 -0400
Ian Shef wrote:
Mayeul <mayeul.marguet@xxxxxxx> wrote in
news:4a708393$0$9973$426a74cc@xxxxxxxxxxxx:
RVic wrote:<snip>Anyway, if all you want to do is to check for even parity, you needOr a table lookup could be used. There are only 256 values in the table. The table could be computed offline and stored in the source code, or the table could be computed at initialization (perhaps by using the counting routine that you showed above). Also, I suspect that there may be faster ways to count. Depending upon how the jvm is implemented, having (1 << i) in the loop may be inefficent. It may be more efficient to do
neither. All you need to do is count the number of 1's in a byte and
check this number is even.
(On a side note, I know of no direct way to do that in Java.
boolean even = true;
for(int i = 0; i < 8; i++) {
if((theByte & (1 << i)) != 0) {
even = !even;
}
}
Maybe?)
if ((theByte & 1) != 0)
as the test, and
theByte >>= 1 ;
for the shift at the end of each iteration. Only one shift is needed per iteration, so there are no questions about whether the processor has a barrel shifter.
To compute the parity of a byte, you can do
byte data = ...;
int parity = data ^ (data >> 4);
parity ^= parity >> 2;
parity ^= parity >> 1;
parity &= 1;
Extending the procedure to short, int, long, and char is left as an
exercise for the reader. (Extending it to float and double is left
as an exercise in futility.)
--
Eric.Sosman@xxxxxxx
.
- References:
- bit operations and parity
- From: RVic
- Re: bit operations and parity
- From: Eric Sosman
- Re: bit operations and parity
- From: RVic
- Re: bit operations and parity
- From: Mayeul
- Re: bit operations and parity
- From: Ian Shef
- bit operations and parity
- Prev by Date: Re: please help!
- Next by Date: Re: bit operations and parity
- Previous by thread: Re: bit operations and parity
- Next by thread: Re: bit operations and parity
- Index(es):
Relevant Pages
|