31. In memory, the lower seven bits of each byte represented the pixels, while the most significant bit served a special purpose. 32. Where m is the number of bits that are required to label the 3D networks, and adding a most significant bit . 33. Because comparing the first two most significant bits would give each key a unique location, the directory size is doubled as follows: 34. For example, the first byte would represent block 0 with the least significant bit and block 7 with the most significant bit . 35. The four most significant bits ( 7-4 ) must be written first, followed by the four least significant bits ( 3-0 ). 36. The dimension for which the most significant bit is largest is then used to compare the two points to determine their shuffle order. 37. If the most significant bit ( the inner ring in Figure 1 ) is rotated enough, it exactly matches the next ring out. 38. In this way it is possible to only transmit, for example, the 3 most significant bits ( with sign ) of each sample. 39. Currently one flag is defined : the " Issuer Critical " flag is represented by the most significant bit of the flags byte. 40. For two's complement values, the meaning of the most significant bit is reversed ( i . e . 1 is less than 0 ).
