Lines Matching refs:bit
23 seven, ten, eleven and sixteen bit 'bytes' have been used. For
36 the native bit-width of a given storage system. This document assumes
39 \subsubsection{bit order}
41 A byte has a well-defined 'least significant' bit (LSb), which is the
42 only bit set when the byte is storing the two's complement integer
43 value +1. A byte's 'most significant' bit (MSb) is at the opposite
70 The Vorbis codec has need to code arbitrary bit-width integers, from
73 is written at the bit position at which the previous field ends.
77 significant bit, etc, until the requested number of bits have been
80 significant unused bit position of the destination byte, followed by
81 the next-least significant bit of the source integer and so on up to
84 byte and writing the next bit into the bit position 0 of that byte.
94 bit binary pattern 'b111' can be taken to represent either 'seven' as
103 Code the 4 bit integer value '12' [b1100] into an empty bytestream.
121 Continue by coding the 3 bit integer value '-1' [b111]:
137 Continue by coding the 7 bit integer value '17' [b0010001]:
150 bit cursor == 6
154 Continue by coding the 13 bit integer value '6969' [b110 11001110 01]:
190 We read two, two-bit integer fields, resulting in the returned numbers
195 four-bit integer, reading some other combination of bit-widths from the
200 two-bit-wide integer 'b11'. This value may be interpreted either as
235 Reading a zero-bit-wide integer returns the value '0' and does not
238 and then reading a zero bit integer shall succeed, returning 0, and
239 not trigger an end-of-packet condition. Reading a zero-bit-wide
