HomeSort by relevance Sort by last modified time
    Searched refs:Huffman (Results 1 - 9 of 9) sorted by null

  /external/aac/libSBRdec/src/
huff_dec.h 86 \brief Huffman Decoder
94 typedef const SCHAR (*Huffman)[2];
97 DecodeHuffmanCW (Huffman h,
huff_dec.cpp 86 \brief Huffman Decoder
93 \brief Decodes one huffman code word
105 DecodeHuffmanCW (Huffman h, /*!< pointer to huffman codebook table */
psbitdec.cpp 96 \brief huffman decoding by codebook table
98 \return index of huffman codebook table
102 decode_huff_cw (Huffman h, /*!< pointer to huffman codebook table */
104 int *length) /*!< length of huffman codeword (or NULL) */
447 Huffman CurrentTable;
536 CurrentTable = (Huffman)&aBookPsIidFineFreqDecode;
538 CurrentTable = (Huffman)&aBookPsIidFreqDecode;
543 CurrentTable = (Huffman)&aBookPsIidFineTimeDecode;
545 CurrentTable = (Huffman)&aBookPsIidTimeDecode
    [all...]
env_extr.cpp 121 and some decoder tuning signals. Raw data is referred to as PCM and Huffman coded envelope and noise floor estimates. The side info also
703 Huffman hcb_noiseF;
704 Huffman hcb_noise;
711 Select huffman codebook depending on coupling mode
714 hcb_noise = (Huffman)&FDK_sbrDecoder_sbr_huffBook_NoiseBalance11T;
715 hcb_noiseF = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance11F; /* "sbr_huffBook_NoiseBalance11F" */
719 hcb_noise = (Huffman)&FDK_sbrDecoder_sbr_huffBook_NoiseLevel11T;
720 hcb_noiseF = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvLevel11F; /* "sbr_huffBook_NoiseLevel11F" */
773 Huffman hcb_t, hcb_f;
810 Select Huffman codebook depending on coupling mode and amplitude resolutio
    [all...]
  /external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/spdy/
HuffmanTest.java 46 assertRoundTrip(Huffman.Codec.REQUEST, buf);
47 assertRoundTrip(Huffman.Codec.RESPONSE, buf);
50 private static void assertRoundTrip(Huffman.Codec codec, byte[] buf) throws IOException {
  /external/libvorbis/doc/
03-codebook.tex 10 decoding configuration, VQ and Huffman, into the bitstream itself in
13 Huffman-equivalent representation for decoding compressed codewords as
15 decoded Huffman value is applied as an offset, generating the final
198 \paragraph{Huffman decision tree representation}
201 \varname{[codebook_entries]} value uniquely define the Huffman decision
206 lowest valued unused binary Huffman codeword possible. Assume the
243 It is clear that the codeword length list represents a Huffman
249 \captionof{figure}{huffman tree illustration}
256 Note that it's possible to underspecify or overspecify a Huffman tree
262 \captionof{figure}{underspecified huffman tree illustration
    [all...]
01-introduction.tex 87 probability model of the codec, the Huffman and VQ codebooks, is
249 Huffman binary tree representation. This tree is tightly packed using
286 the complete VQ and Huffman codebooks needed for decode.
  /external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/spdy/
HpackDraft05.java 98 private final Huffman.Codec huffmanCodec;
123 this.huffmanCodec = client ? Huffman.Codec.RESPONSE : Huffman.Codec.REQUEST;
363 * Reads a potentially Huffman encoded string byte string. When
374 byteString = huffmanCodec.decode(byteString); // TODO: streaming Huffman!
Huffman.java 32 class Huffman {
184 * @param bits length of Huffman code in bits
194 // Appendix C: Huffman Codes For Requests
240 // Appendix D: Huffman Codes For Responses

Completed in 730 milliseconds