/external/zlib/src/doc/ |
D | rfc1951.txt | 43 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 …]
|
D | algorithm.txt | 13 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/aac/libSBRdec/src/ |
D | huff_dec.h | 94 typedef const SCHAR (*Huffman)[2]; typedef 97 DecodeHuffmanCW (Huffman h,
|
D | env_extr.cpp | 703 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 …]
|
D | psbitdec.cpp | 102 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()
|
D | huff_dec.cpp | 105 DecodeHuffmanCW (Huffman h, /*!< pointer to huffman codebook table */ in DecodeHuffmanCW()
|
/external/jpeg/ |
D | filelist.doc | 31 jchuff.h Private declarations for Huffman encoder modules. 32 jdhuff.h Private declarations for Huffman decoder modules. 75 jchuff.c Huffman entropy coding for sequential JPEG. 76 jcphuff.c Huffman entropy coding for progressive JPEG. 88 jdhuff.c Huffman entropy decoding for sequential JPEG. 89 jdphuff.c Huffman entropy decoding for progressive JPEG.
|
D | change.log | 39 Huffman tables being used. 41 Huffman tables are checked for validity much more carefully than before. 210 Huffman tables can be stored separately from the image data.
|
D | structure.doc | 139 * Entropy coding (sequential or progressive, Huffman or arithmetic). 150 * Entropy decoding (sequential or progressive, Huffman or arithmetic). 363 Huffman-code optimization or emitting a multiscan JPEG file, this 374 * Entropy encoding: Perform Huffman or arithmetic entropy coding and emit the 451 Huffman or arithmetic entropy decoding. Works on one MCU per call. 701 Rather than trying to restart at an arbitrary point, the current Huffman 716 In a successive-approximation AC refinement scan, the progressive Huffman 720 but probably won't have much effect on performance. Other variants of Huffman 930 Huffman decoder; this implies a speed penalty whether the feature is used
|
D | libjpeg.doc | 443 If you have requested a multi-pass operating mode, such as Huffman code 899 TRUE causes the compressor to compute optimal Huffman coding tables 903 Huffman tables. In most cases optimal tables save only a few percent 905 TRUE, you need not supply Huffman tables at all, and any you do 977 Pointers to Huffman coding tables, one per table slot, or NULL if 981 Note that optimal Huffman tables can be computed for an image 983 any need to mess with providing your own Huffman tables. 1594 Huffman code optimization and multiple-scan output. Those modes write the 1728 to the decoder's coefficient buffer. This is fast because only Huffman 1753 should also note that the compressor currently forces Huffman optimization [all …]
|
D | install.doc | 346 If the cjpeg test run fails with "Missing Huffman code table entry", it's a 471 order to generate valid Huffman tables. This is necessary because our 472 default Huffman tables only cover 8-bit data.
|
D | README | 181 Huffman mode, it is unlikely that very many implementations will support it.)
|
/external/qemu/distrib/jpeg-6b/ |
D | filelist.doc | 31 jchuff.h Private declarations for Huffman encoder modules. 32 jdhuff.h Private declarations for Huffman decoder modules. 75 jchuff.c Huffman entropy coding for sequential JPEG. 76 jcphuff.c Huffman entropy coding for progressive JPEG. 88 jdhuff.c Huffman entropy decoding for sequential JPEG. 89 jdphuff.c Huffman entropy decoding for progressive JPEG.
|
D | change.log | 39 Huffman tables being used. 41 Huffman tables are checked for validity much more carefully than before. 210 Huffman tables can be stored separately from the image data.
|
D | structure.doc | 139 * Entropy coding (sequential or progressive, Huffman or arithmetic). 150 * Entropy decoding (sequential or progressive, Huffman or arithmetic). 363 Huffman-code optimization or emitting a multiscan JPEG file, this 374 * Entropy encoding: Perform Huffman or arithmetic entropy coding and emit the 451 Huffman or arithmetic entropy decoding. Works on one MCU per call. 701 Rather than trying to restart at an arbitrary point, the current Huffman 716 In a successive-approximation AC refinement scan, the progressive Huffman 720 but probably won't have much effect on performance. Other variants of Huffman 930 Huffman decoder; this implies a speed penalty whether the feature is used
|
D | libjpeg.doc | 443 If you have requested a multi-pass operating mode, such as Huffman code 899 TRUE causes the compressor to compute optimal Huffman coding tables 903 Huffman tables. In most cases optimal tables save only a few percent 905 TRUE, you need not supply Huffman tables at all, and any you do 977 Pointers to Huffman coding tables, one per table slot, or NULL if 981 Note that optimal Huffman tables can be computed for an image 983 any need to mess with providing your own Huffman tables. 1594 Huffman code optimization and multiple-scan output. Those modes write the 1728 to the decoder's coefficient buffer. This is fast because only Huffman 1753 should also note that the compressor currently forces Huffman optimization [all …]
|
D | install.doc | 346 If the cjpeg test run fails with "Missing Huffman code table entry", it's a 471 order to generate valid Huffman tables. This is necessary because our 472 default Huffman tables only cover 8-bit data.
|
D | README | 181 Huffman mode, it is unlikely that very many implementations will support it.)
|
/external/libvorbis/doc/ |
D | 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 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,
|
D | 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/zlib/src/as400/ |
D | readme.txt | 80 inftrees.c INFTREES C ZLIB - Generate Huffman trees for efficient decode 81 trees.c TREES C ZLIB - Output deflated data using Huffman coding
|
/external/zlib/src/examples/ |
D | README.examples | 7 construction over all possible Huffman codes
|
/external/llvm/docs/HistoricalNotes/ |
D | 2000-12-06-MeetingSummary.txt | 79 C. Use something similar to Huffman encoding, so that the most common
|
/external/bzip2/ |
D | bzip2.txt | 17 sorting text compression algorithm, and Huffman coding. 377 the Huffman coder), Peter Fenwick (for the structured cod-
|
D | bzip2.1.preformatted | 20 sorting text compression algorithm, and Huffman coding. 382 the Huffman coder), Peter Fenwick (for the structured cod
|