Least significant bit

The two least significant bits of each value are combined into the Mixed bits field. 

The runs are first listed in standard order (i.e., a binary counting sequence, least significant bit on the right) ... 

Vanderkooy and Lipshitz, 1984] Vanderkooy, J. and Lipshitz, S. (1984). Resolution below the Least Significant Bit in Digital Systems with Dither. J. Audio Eng. Society, 32 106-113. Correction, ibid., vol. 32, pp. 889, June 1987. 

For each block Xr, a cryptographic hash H(K, m, n, Xr) (such as MD5, [6]) is computed, where K is the user s key. The first kl bits of the hash output, treated as a k x l rectangular array, are XORed with the current watermark block Wr to form a new binary block Cr. Each element of Cr is inserted into the least significant bit of the corresponding element in Xr, generating the output block X r. 

If the n-l least significant bits are zero, then set the least significant bit to one. 

Since we have to handle sets of clock values, we encode the values by bit vectors in such a way, that every value has an associated bit. ) th this one hot encoding we are able to represent sets of clock values. E.g. the set 0,3,4,5 is encoded by a bit vector 6 = 0... OllKKll, where the least significant bit encodes the zero value. 

Bit selection is another example where multiple graph types are useful. Suppose we want to select the least significant bit (LSB) from the BMD representation of an arithmetic function /. If / is given as an unsigned integer representation, selecting the LSB is equivalent to computing the parity of / ... 

MOVI (moving inversion) This test checks for address propagation failures. It is similar to a march but in addition uses each address Hne as the least significant bit in a counting sequence. 

---