The next least significant bit drives a speaker of twice this area, and so on.
The most significant bit of the first array element is examined.
Effectively, we are only computing the values for which the most significant bit of the window is set.
We wouldn't notice if the least significant bit in the various color bytes was off or on.
Less significant bits are sometimes ignored to reduce the tree size.
Therefore, the least significant bit can be used (more or less undetectably) for something else other than color information.
P is a counting class, and can be seen as finding the least significant bit of the answer to the corresponding problem.
Again, the least significant bit (rightmost in this table) is sent first.
Many implementations check the least significant bit to see if it is a 1.
The address and the data bytes are sent most significant bit first.
