Bit numbering

In computing, bit numbering (or sometimes bit endianness) is the convention used to identify the bit positions in a binary number or a container for such a value. The bit number starts with zero and is incremented by one for each subsequent bit position.

When the bit numbering starts at zero for the least significant bit (LSB) the numbering scheme is called "LSB 0". This bit numbering method has the advantage that for any unsigned number the value of the number can be calculated by using exponentiation with the bit number and a base of 2. The value of an unsigned binary integer is therefore

where b_i denotes the value of the bit with number i, and N denotes the number of bits in total.

Similarly, when the bit numbering starts at zero for the most significant bit (MSB) the numbering scheme is called "MSB 0".

The value of an unsigned binary integer is therefore

ALGOL 68's elem operator is effectively "MSB 1 bit numbering" as the bits are numbered from left to right, with the first bit (bits elem 1) being the "most significant bit", and the expression (bits elem bits width) giving the "least significant bit". Similarly, when bits are coerced (typecast) to an array of Boolean ([ ]bool bits), the first element of this array (bits[lwb bits]) is again the "most significant bit".

For MSB 1 numbering, the value of an unsigned binary integer is

PL/I numbers BIT strings starting with 1 for the leftmost bit.

The Fortran BTEST function uses LSB 0 numbering.

Little-endian CPUs usually employ "LSB 0" bit numbering, however both bit numbering conventions can be seen in big-endian machines. Some architectures like SPARC and Motorola 68000 use "LSB 0" bit numbering, while S/390, PowerPC and PA-RISC use "MSB 0".

...
Wikipedia