Home
last modified time | relevance | path

Searched refs:Huffman (Results 1 – 25 of 31) sorted by relevance

12

/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/framed/
DHuffman.java31 class Huffman { class
77 private static final Huffman INSTANCE = new Huffman();
79 public static Huffman get() { in get()
85 private Huffman() { in Huffman() method in Huffman
DHpack.java350 return ByteString.of(Huffman.get().decode(source.readByteArray(length))); in readByteString()
/external/zlib/src/doc/
Drfc1951.txt43 compresses data using a combination of the LZ77 algorithm and Huffman
77 3.2.1. Synopsis of prefix and Huffman coding ............... 6
78 3.2.2. Use of Huffman coding in the "deflate" format ....... 7
82 3.2.6. Compression with fixed Huffman codes (BTYPE=01) .... 12
83 3.2.7. Compression with dynamic Huffman codes (BTYPE=10) .. 13
146 representations. Familiarity with the technique of Huffman coding
194 and Huffman coding. The Huffman trees for each block are independent
199 Each block consists of two parts: a pair of Huffman code trees that
201 compressed data part. (The Huffman trees themselves are compressed
202 using Huffman encoding.) The compressed data consists of a series of
[all …]
Dalgorithm.txt13 Literals or match lengths are compressed with one Huffman tree, and
28 favor small distances and thus take advantage of the Huffman encoding.
62 The key question is how to represent a Huffman code (or any prefix code) so
95 looks like. You are correct that it's not a Huffman tree. It is simply a
96 lookup table for the first, let's say, nine bits of a Huffman symbol. The
124 that's essentially a Huffman tree. But then you spend too much time
183 compared to 16 entries for a Huffman tree (six two entry tables and one four
187 Huffman tree.
/external/okhttp/okhttp-tests/src/test/java/com/squareup/okhttp/internal/framed/
DHuffmanTest.java49 Huffman.get().encode(buf, dos); in assertRoundTrip()
50 assertEquals(baos.size(), Huffman.get().encodedLength(buf)); in assertRoundTrip()
52 byte[] decodedBytes = Huffman.get().decode(baos.toByteArray()); in assertRoundTrip()
/external/aac/libSBRdec/src/
Denv_extr.cpp703 Huffman hcb_noiseF; in sbrGetNoiseFloorData()
704 Huffman hcb_noise; in sbrGetNoiseFloorData()
714 hcb_noise = (Huffman)&FDK_sbrDecoder_sbr_huffBook_NoiseBalance11T; in sbrGetNoiseFloorData()
715 …hcb_noiseF = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance11F; /* "sbr_huffBook_NoiseBalance11… in sbrGetNoiseFloorData()
719 hcb_noise = (Huffman)&FDK_sbrDecoder_sbr_huffBook_NoiseLevel11T; in sbrGetNoiseFloorData()
720 …hcb_noiseF = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvLevel11F; /* "sbr_huffBook_NoiseLevel11F"… in sbrGetNoiseFloorData()
773 Huffman hcb_t, hcb_f; in sbrGetEnvelope()
815 hcb_t = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance10T; in sbrGetEnvelope()
816 hcb_f = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance10F; in sbrGetEnvelope()
819 hcb_t = (Huffman)&FDK_sbrDecoder_sbr_huffBook_EnvBalance11T; in sbrGetEnvelope()
[all …]
Dpsbitdec.cpp102 decode_huff_cw (Huffman h, /*!< pointer to huffman codebook table */ in decode_huff_cw()
447 Huffman CurrentTable; in ReadPsData()
536 CurrentTable = (Huffman)&aBookPsIidFineFreqDecode; in ReadPsData()
538 CurrentTable = (Huffman)&aBookPsIidFreqDecode; in ReadPsData()
543 CurrentTable = (Huffman)&aBookPsIidFineTimeDecode; in ReadPsData()
545 CurrentTable = (Huffman)&aBookPsIidTimeDecode; in ReadPsData()
559 CurrentTable = (Huffman)&aBookPsIccFreqDecode; in ReadPsData()
561 CurrentTable = (Huffman)&aBookPsIccTimeDecode; in ReadPsData()
Dhuff_dec.h94 typedef const SCHAR (*Huffman)[2]; typedef
97 DecodeHuffmanCW (Huffman h,
Dhuff_dec.cpp105 DecodeHuffmanCW (Huffman h, /*!< pointer to huffman codebook table */ in DecodeHuffmanCW()
/external/libjpeg-turbo/
DChangeLog.txt7 allows the Huffman codec to determine the word size at compile time. Since
13 [2] Fixed an issue in the accelerated Huffman decoder that could have caused
16 libjpeg-turbo, the accelerated Huffman decoder was invoked (in most cases) only
18 to construct a JPEG image in which a single Huffman block is over 430 bytes
19 long, so this version of libjpeg-turbo activates the accelerated Huffman
26 path" of libjpeg-turbo's Huffman decoder to read from uninitialized memory.
105 Huffman codec was not being compiled in when libjpeg-turbo was built on
108 [7] Fixed an extremely rare bug in the Huffman encoder that caused 64-bit
110 quality=98, an optimized Huffman table, and the slow integer forward DCT were
143 [5] The Huffman encoder now uses clz and bsr instructions for bit counting on
[all …]
Dchange.log118 Huffman tables being used.
120 Huffman tables are checked for validity much more carefully than before.
289 Huffman tables can be stored separately from the image data.
Dstructure.txt108 * Entropy coding (sequential or progressive, Huffman or arithmetic).
119 * Entropy decoding (sequential or progressive, Huffman or arithmetic).
332 Huffman-code optimization or emitting a multiscan JPEG file, this
343 * Entropy encoding: Perform Huffman or arithmetic entropy coding and emit the
421 Huffman or arithmetic entropy decoding. Works on one MCU per call.
659 Rather than trying to restart at an arbitrary point, the current Huffman
674 In a successive-approximation AC refinement scan, the progressive Huffman
678 but probably won't have much effect on performance. Other variants of Huffman
888 Huffman decoder; this implies a speed penalty whether the feature is used
DREADME-turbo.txt10 highly-optimized Huffman coding routines. In many cases, the performance of
321 The optimized Huffman decoder in libjpeg-turbo does not handle restart markers
323 necessary to use the slow Huffman decoder when decompressing a JPEG image that
Dlibjpeg.txt444 If you have requested a multi-pass operating mode, such as Huffman code
995 TRUE causes the compressor to compute optimal Huffman coding tables
999 Huffman tables. In most cases optimal tables save only a few percent
1001 TRUE, you need not supply Huffman tables at all, and any you do
1100 Pointers to Huffman coding tables, one per table slot, or NULL if
1104 Note that optimal Huffman tables can be computed for an image
1106 any need to mess with providing your own Huffman tables.
1753 Huffman code optimization and multiple-scan output. Those modes write the
1887 to the decoder's coefficient buffer. This is fast because only Huffman
1912 should also note that the compressor currently forces Huffman optimization
[all …]
/external/libvorbis/doc/
D03-codebook.tex10 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
256 Note that it's possible to underspecify or overspecify a Huffman tree
393 Huffman decode tree by reading one bit at a time from the bitstream,
D01-introduction.tex87 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/zlib/src/as400/
Dreadme.txt80 inftrees.c INFTREES C ZLIB - Generate Huffman trees for efficient decode
81 trees.c TREES C ZLIB - Output deflated data using Huffman coding
/external/libjpeg-turbo/release/
DReadMe.txt1 …rform libjpeg by a significant amount, by virtue of its highly-optimized Huffman coding routines. …
Ddeb-control.tmpl16 of its highly-optimized Huffman coding routines. In many cases, the
Dlibjpeg-turbo.spec.in51 highly-optimized Huffman coding routines. In many cases, the performance of
/external/zlib/src/examples/
DREADME.examples7 construction over all possible Huffman codes
/external/llvm/docs/HistoricalNotes/
D2000-12-06-MeetingSummary.txt79 C. Use something similar to Huffman encoding, so that the most common
/external/opencv3/3rdparty/libjpeg/
Dchange.log204 Huffman tables being used.
206 Huffman tables are checked for validity much more carefully than before.
375 Huffman tables can be stored separately from the image data.
/external/bzip2/
Dbzip2.txt17 sorting text compression algorithm, and Huffman coding.
377 the Huffman coder), Peter Fenwick (for the structured cod-
Dbzip2.1.preformatted20 sorting text compression algorithm, and Huffman coding.
382 the Huffman coder), Peter Fenwick (for the structured cod­

12