Reversing Bit Order.. i.e. MSB becomes bit 0, LSB becomes bit 15

[benn686]

Anyone know of an efficient way of reversing the bits of a word??

[int2str]

On Aug 17, 5:36 pm, benn...@hotmail .com wrote:

Anyone know of an efficient way of reversing the bits of a word??

htons() <-ntohs()

[Ian Collins]

be*****@hotmail .com wrote:

Anyone know of an efficient way of reversing the bits of a word??

Not portably, some instructions sets may have a quick way to do this,
otherwise shift and add.

--
Ian Collins.

[BobR]

<be*****@hotmai l.comwrote in message...

Anyone know of an efficient way of reversing the bits of a word??

{ using std::cout; // for NG post
size_t num( 12345 );
// std::bitset<32B its( num ); // #include <bitset>
std::bitset<std ::numeric_limit s<size_t>::digi tsBits( num );

cout<<"size_t num="<<num<<std ::endl;
cout<<"bitset<3 2Bits="<<Bits<< std::endl;
Bits.flip();
cout<<"bitset<3 2Bits="<<Bits<< std::endl;
num = Bits.to_ulong() ; // be careful with sizes.
cout<<"size_t num="<<num<<std ::endl;

size_t num2( 12345 );
cout<<"size_t num2="<<num2<<s td::endl;
num2 = ~num2;
cout<<"size_t num2="<<num2<<s td::endl;
}
/* -output-
size_t num=12345
bitset<32Bits=0 000000000000000 001100000011100 1
bitset<32Bits=1 111111111111111 110011111100011 0
size_t num=4294954950
size_t num2=12345
size_t num2=4294954950
*/

--
Bob R
POVrookie

[Juha Nieminen]

be*****@hotmail .com wrote:

Anyone know of an efficient way of reversing the bits of a word??

Reverse all the bits in a 32 bit word:

n = ((n > 1) & 0x55555555) | ((n << 1) & 0xaaaaaaaa) ;
n = ((n > 2) & 0x33333333) | ((n << 2) & 0xcccccccc) ;
n = ((n > 4) & 0x0f0f0f0f) | ((n << 4) & 0xf0f0f0f0) ;
n = ((n > 8) & 0x00ff00ff) | ((n << 8) & 0xff00ff00) ;
n = ((n >16) & 0x0000ffff) | ((n << 16) & 0xffff0000) ;

[benn686]

Wow! That is slick, and it worked nicely too!

Not quite sure how it works, but for 16 bits, would it work something
like:

n = ((n > 1) & 0x5555) | ((n << 1) & 0xaaaa) ;
n = ((n > 2) & 0x3333) | ((n << 2) & 0xcccc) ;
n = ((n > 4) & 0x0f0f) | ((n << 4) & 0x0f0f) ;
Juha Nieminen wrote:

be*****@hotmail .com wrote:

Anyone know of an efficient way of reversing the bits of a word??

Reverse all the bits in a 32 bit word:

n = ((n > 1) & 0x55555555) | ((n << 1) & 0xaaaaaaaa) ;
n = ((n > 2) & 0x33333333) | ((n << 2) & 0xcccccccc) ;
n = ((n > 4) & 0x0f0f0f0f) | ((n << 4) & 0xf0f0f0f0) ;
n = ((n > 8) & 0x00ff00ff) | ((n << 8) & 0xff00ff00) ;
n = ((n >16) & 0x0000ffff) | ((n << 16) & 0xffff0000) ;

[hurcan solter]

On Aug 21, 12:55 am, benn...@hotmail .com wrote:

Wow! That is slick, and it worked nicely too!

Not quite sure how it works, but for 16 bits, would it work something
like:

n = ((n > 1) & 0x5555) | ((n << 1) & 0xaaaa) ;
n = ((n > 2) & 0x3333) | ((n << 2) & 0xcccc) ;
n = ((n > 4) & 0x0f0f) | ((n << 4) & 0x0f0f) ;

Textbook example; and please dont top-post...
template<typena me T>
T reverseBits(T inval){

T retval=0;
numberofbits= sizeof(T) * CHAR_BITS;
for ( int i = 0; i < numberofbits; ++i ) {
retval = ( retval << 1 ) | ( inval & 1 );
inval >>= 1;
}
return retval;
}

[Juha Nieminen]

be*****@hotmail .com wrote:

Wow! That is slick, and it worked nicely too!

Not quite sure how it works, but for 16 bits, would it work something
like:

n = ((n > 1) & 0x5555) | ((n << 1) & 0xaaaa) ;
n = ((n > 2) & 0x3333) | ((n << 2) & 0xcccc) ;
n = ((n > 4) & 0x0f0f) | ((n << 4) & 0x0f0f) ;

I believe it additionally needs:

n = ((n > 8) & 0x00ff) | ((n << 8) & 0xff00) ;