Bit numbering - Misplaced Pages

(Redirected from Bit position) Convention to identify bit positions

In computing, bit numbering is the convention used to identify the bit positions in a binary number.

Bit significance and indexing

150_dec	MSb							LSb
Bit Content	1	0	0	1	0	1	1	0

In computing, the least significant bit (LSb) is the bit position in a binary integer representing the binary 1s place of the integer. Similarly, the most significant bit (MSb) represents the highest-order place of the binary integer. The LSb is sometimes referred to as the low-order bit or right-most bit, due to the convention in positional notation of writing less significant digits further to the right. The MSb is similarly referred to as the high-order bit or left-most bit. In both cases, the LSb and MSb correlate directly to the least significant digit and most significant digit of a decimal integer.

Bit indexing correlates to the positional notation of the value in base 2. For this reason, bit index is not affected by how the value is stored on the device, such as the value's byte order. Rather, it is a property of the numeric value in binary itself. This is often utilized in programming via bit shifting: A value of 1 << n corresponds to the n bit of a binary integer (with a value of 2).

Least significant bit in digital steganography

In digital steganography, sensitive messages may be concealed by manipulating and storing information in the least significant bits of an image or a sound file. The user may later recover this information by extracting the least significant bits of the manipulated pixels to recover the original message. This allows the storage or transfer of digital information to remain concealed.

A diagram showing how manipulating the least significant bits of a color can have a very subtle and generally unnoticeable effect on the color. In this diagram, green is represented by its RGB value, both in decimal and in binary. The red box surrounding the last two bits illustrates the least significant bits changed in the binary representation.

Unsigned integer example

This table illustrates an example of decimal value of 149 and the location of LSb. In this particular example, the position of unit value (decimal 1 or 0) is located in bit position 0 (n = 0). MSb stands for most significant bit, while LSb stands for least significant bit.

149_dec in LSb₀	MSb							LSb
Bit Weight	$2^{7}$ 128	$2^{6}$ 64	$2^{5}$ 32	$2^{4}$ 16	$2^{3}$ 8	$2^{2}$ 4	$2^{1}$ 2	$2^{0}$ 1
Bit Content	1	0	0	1	0	1	0	1

Signed integer example

This table illustrates an example of an 8 bit signed decimal value using the two's complement method. The MSb most significant bit has a negative weight in signed integers, in this case -2 = -128. The other bits have positive weights. The lsb (least significant bit) has weight 2=1. The signed value is in this case -128+2 = -126.

-126_dec in LSb₀	MSb							LSb
Bit Weight	$-2^{7}$ -128	$2^{6}$ 64	$2^{5}$ 32	$2^{4}$ 16	$2^{3}$ 8	$2^{2}$ 4	$2^{1}$ 2	$2^{0}$ 1
Bit Content	1	0	0	0	0	0	1	0

Most- vs least-significant bit first

The expressions most significant bit first and least significant bit at last are indications on the ordering of the sequence of the bits in the bytes sent over a wire in a serial transmission protocol or in a stream (e.g. an audio stream).

Most significant bit first means that the most significant bit will arrive first: hence e.g. the hexadecimal number 0x12, 00010010 in binary representation, will arrive as the sequence 0 0 0 1 0 0 1 0 .

Least significant bit first means that the least significant bit will arrive first: hence e.g. the same hexadecimal number 0x12, again 00010010 in binary representation, will arrive as the (reversed) sequence 0 1 0 0 1 0 0 0.

LSb 0 bit numbering

150_dec in LSb₀	MSb							LSb
Bit Number	7							0
Bit Weight	$2^{7}$ 128	$2^{6}$ 64	$2^{5}$ 32	$2^{4}$ 16	$2^{3}$ 8	$2^{2}$ 4	$2^{1}$ 2	$2^{0}$ 1
Bit Content	1	0	0	1	0	1	1	0

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

\sum _{i=0}^{N-1}b_{i}\cdot 2^{i}

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

MSb 0 bit numbering

150_dev in MSb₀	MSb							LSb
Bit Number	0							7
Bit Weight	$2^{7-0}$ 128	$2^{7-1}$ 64	$2^{7-2}$ 32	$2^{7-3}$ 16	$2^{7-4}$ 8	$2^{7-5}$ 4	$2^{7-6}$ 2	$2^{7-7}$ 1
Bit Content	1	0	0	1	0	1	1	0

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

\sum _{i=0}^{N-1}b_{i}\cdot 2^{N-1-i}

LSb calculation

LSb of a number can be calculated with time complexity of $O(n)$ with formula $a\And (\sim a+1)$ , where $\And$ means bitwise operation AND and $\sim$ means bitwise operation NOT on $a$ .