Lines Matching refs:As
13 Huffman-equivalent representation for decoding compressed codewords as
14 well as an optional lookup table of output vector values to which a
15 decoded Huffman value is applied as an offset, generating the final
21 from a packet as a series of arbitrary-width values read from the
101 6) this entry is unused. mark it as such.
123 3) [number] = read \link{vorbis:spec:ilog}{ilog}([codebook_entries] - [current_entry]) bits as an unsigned integer
149 The lookup table type is read as a four bit unsigned integer:
151 1) [codebook_lookup_type] = read four bits as an unsigned integer
166 possible scalar values. Lookup decode proceeds as follows:
169 1) [codebook_minimum_value] = \link{vorbis:spec:float32:unpack}{float32_unpack}( read 32 bits as an unsigned integer)
170 2) [codebook_delta_value] = \link{vorbis:spec:float32:unpack}{float32_unpack}( read 32 bits as an unsigned integer)
171 3) [codebook_value_bits] = read 4 bits as an unsigned integer and add 1
172 4) [codebook_sequence_p] = read 1 bit as a boolean flag
253 As we assign codewords in order, we see that each choice constructs a
307 \varname{[codebook_multiplicands]} as follows (\varname{[value_vector]}
340 \varname{[codebook_multiplicands]} as follows (\varname{[value_vector]}
372 The decoder uses the codebook abstraction much as it does the
376 entropy coding context), or uses that entry number as an offset into
392 codebook. This process can be though of as logically walking the
394 and using the bit as a decision boolean to take the 0 branch (left in
404 When used in a VQ context, the codeword entry number is used as an
