📄 book-index.html
字号:
<!DOCTYPE HTML PUBLIC "html.dtd"><HTML><HEAD><TITLE>The Data Compression Book-:Index</TITLE><META NAME="ROBOTS" CONTENT="NOINDEX, NOFOLLOW"><SCRIPT><!--function displayWindow(url, width, height) { var Win = window.open(url,"displayWindow",'width=' + width +',height=' + height + ',resizable=1,scrollbars=yes');}//--></SCRIPT></HEAD><BODY BGCOLOR="#FFFFFF" VLINK="#DD0000" TEXT="#000000" LINK="#DD0000" ALINK="#FF0000"><TD WIDTH="540" VALIGN="TOP"><!-- <CENTER><TABLE><TR><TD><FORM METHOD="GET" ACTION="http://search.itknowledge.com/excite/cgi-bin/AT-foldocsearch.cgi"><INPUT NAME="search" SIZE="20" VALUE=""><BR><CENTER><INPUT NAME="searchButton" TYPE="submit" VALUE="Glossary Search"></CENTER><INPUT NAME="source" TYPE="hidden" VALUE="local" CHECKED> <INPUT NAME="bltext" TYPE="hidden" VALUE="Back to Search"><INPUT NAME="sp" TYPE="hidden" VALUE="sp"></FORM></TD><TD><IMG SRC="http://www.itknowledge.com/images/dotclear.gif" WIDTH="15" HEIGHT="1"></TD><TD><FORM METHOD="POST" ACTION="http://search.itknowledge.com/excite/cgi-bin/AT-subscriptionsearch.cgi"><INPUT NAME="search" SIZE="20" VALUE=""><BR><CENTER><INPUT NAME="searchButton" TYPE="submit" VALUE=" Book Search "></CENTER><INPUT NAME="source" TYPE="hidden" VALUE="local" CHECKED> <INPUT NAME="backlink" TYPE="hidden" VALUE="http://search.itknowledge.com:80/excite/AT-subscriptionquery.html"><INPUT NAME="bltext" TYPE="hidden" VALUE="Back to Search"><INPUT NAME="sp" TYPE="hidden" VALUE="sp"></FORM></TD></TR></TABLE></CENTER> --><!-- ISBN=1558514341//--><!-- TITLE=The Data Compression Book-//--><!-- AUTHOR=Mark Nelson//--><!-- PUBLISHER=IDG Books Worldwide, Inc.//--><!-- IMPRINT=M & T Books//--><!-- CHAPTER=0//--><!-- PAGES=543-557//--><!-- UNASSIGNED1//--><!-- UNASSIGNED2//--><CENTER><TABLE BORDER><TR><TD><A HREF="ewtoc.html">Table of Contents</A></TD></TR></TABLE></CENTER><P><BR></P><H2><A NAME="Heading1"></A><FONT COLOR="#000077">Index</FONT></H2><P><FONT SIZE="+1"><B>A</B></FONT></P><DL><DD>ACT (Archive Comparison Test), 25<DD>adaptive compression, 76-77, 527. <I>See also</I> adaptive Huffman coding<DL><DD>dictionary-based compression, 203-207<DL><DD>example (QIC-122), 204-207</DL><DD>with graphic files, 325-326</DL><DD>Adaptive Differential Pulse Code Modulation (ADPCM), 319, 527<DD>adaptive Huffman coding, 77-112<DL><DD>algorithm for, 82<DD>code for, 88-89, 101-112<DD>compression program, 91, 101-112<DD>EncodeSymbol routine, 92-95<DD>escape code in, 83-84<DD>expand program, 91-92, 101<DD>incoming symbols, 100-101<DD>initialization of array, 89-90<DD>overflow problem with, 84-87<DD>rescaling, benefit of, 87-88<DD>swapping in, 81, 96-97<DD>symbols not used, coding space for, 82-83<DD>updating tree in, 77-80, 95-100</DL><DD>adaptive modeling, 18-20, 155-162, 527. <I>See also</I> <DD>adaptive compression; adaptive Huffman coding<DL><DD>compression in, 19<DD>decompression in, 19</DL><DD>ADC. <I>See</I> analog-to-digital converter<DD>AddFileListToArchive() routine (CARMAN), 399-400<DD>Add files command (CARMAN), 382-383<DD>AddString() routine (LZSS), 235-238<DD>Adobe, 213<DD>ADPCM (Adaptive Differential Pulse Code Modulation), 319, 527<DD>affine functions, 462-463<DD>affine maps, 476-477<DD>AHUFF.C, 101-112<DL><DD>statistics for, 512-514</DL><DD>alphabets, 527<DD>American National Standards Institute (ANSI), 3<DD>analog-to-digital converter (ADC), 292-295, 311, 312<DD>ANSI (American National Standards Institute), 3<DD>ANSI C, 3-6<DL><DD>prototyping in, 43-44</DL><DD>Apple, 213-214, 298<DD>ARC (compression program), 24, 209, 210, 528<DD>Archive Comparison Test (ACT), 25<DD>archives, 527<DD>ARITH.C, 123, 136-152<DL><DD>statistics for, 512-514</DL><DD>ARITH-1.C., 156-162<DL><DD>code for, 156-158<DD>escape code as fallback with, 159-161<DD>improvements to, 161-162</DL><DD>ARITH-N.C, 163-200<DL><DD>code for, 172-200<DD>escape possibilities, 164-165<DD>flush code for, 170<DD>memory and implementation of, 170<DD>order(-1) table for, 169<DD>order(-2) table for, 169-170<DD>potential improvements to, 171<DD>redesign of data structures for, 166-169<DD>scoreboarding with, 165-166<DD>statistics for, 512-514<DD>updating ARITH-1.C. for, 163-164</DL><DD>arithmetic coding, 16-17, 114-152, 528<DL><DD>code for, 123, 136-152<DD>compression program, 124-125, 136-152<DD>decoding process in, 116-117, 121-122, 133-136<DD>encoding process in, 114-116, 120-121, 130-133<DD>expansion program, 125-126<DD>floating-point math with, 118<DD>flushing encoder in, 133<DD>Huffman coding, advantages over, 113-114, 122-123<DD>initialization<DD>of encoder, 130<DD>of model, 126-130<DD>integer registers, using, 118-120<DD>output from, 114<DD>totals[] array, building, 130<DD>underflow, handling, 120-121</DL><DD>ARJ (compression program), 24, 209, 210, 299-302, 381, 528<DD>Association for Shareware Professionals (ASP), 534-535<DD>AT&T, 290<DD>audio, digital. <I>See</I> digital audio<DD>average_boundaries() function (FRAC.C), 477</DL><P><FONT SIZE="+1"><B>B</B></FONT></P><DL><DD>Barnsley, Michael, 458-459, 462<DD>BITIO.C, 35-43<DD>BITIO.H, 36-38<DD>black cube, 298<DD>block coding, 528<DD>“blocky” images, 469<DD>Boss, Roger, 458, 510<DD>BuildFileList() routine (CARMAN), 393-394<DD>build_model() routine (arithmetic coding), 124, 127-128<DD>build_totals() routine (arithmetic coding), 130<DD>build_tree() (HUFF.C), 58</DL><P><FONT SIZE="+1"><B>C</B></FONT></P><DL><DD>C (programming language)<DL><DD>issues in writing portable, 3-7<DD>reasons for using, 2-3<DD>versions of, 3</DL><DD>CAR files, 382<DL><DD>structure of, 384</DL><DD>CARMAN, 381-455<DL><DD>archive files, opening, 396-398<DD>CAR files in, 382, 384<DD>code, 408-455<DD>command-line processing in, 390-392<DD>command set, 382-383<DD>file list, generating, 392-396<DD>headers, 384-390<DL><DD>CRC, header, 388-390<DD>storing, 385-388</DL><DD>main processing loop of, 399-408<DL><DD>extraction, file, 406-408<DD>input file, skipping/copying, 404-405<DD>insertion, file, 405-406<DD>workspace cleanup, 408</DL></DL><DD>CCITT (Consultive Committee for International Telegraph and Telephone), 22, 326, 528<DD>Central Point Software, 210<DD>CHEETAH.GS, 340, 375-379<DD>CHURN.C, 517-526<DD>classify_domains() function (FRAC.C), 474-475<DD>Cleary, John, 162<DD>codecs, 312-314<DD>codes, 528<DD>coding, 15-17, 528<DL><DD>adaptive, 76-77<DD>modeling vs., 12-13</DL><DD>Collage Theorem, 462<DD>color images, 344-345<DL><DD>fractal compression of, 461</DL><DD>COMPACT (compression program), 23, 529<DD>COMPAND.C, 314-318<DD>companding, 310-318<DL><DD>code, 314-318<DD>codecs with, 312-314<DD>and linear conversion, 311-312<DD>and minimum resolution, 310-311</DL><DD>compilers, 4<DD>COMPRESS (compression program), 23, 208, 529<DL><DD>and LZW, 262</DL><DD>compressed archive files, 381-382<DD>compress_init() function (FRAC.C), 473-474<DD>compression, lossy vs. lossless, 11-12<DD>compression algorithms<DL><DD>adaptive Huffman coding, 91, 101-112<DD>arithmetic coding, 124-125, 136-152<DD>DCT.C, 346-348<DD>fractal compression, 461-467, 472<DD>LZ77, 216-218<DD>LZSS, 227, 231-242<DL><DD>AddString() routine, 235-238<DD>DeleteString() routine, 238-240<DD>exit code, 235<DD>initialization, 232-233<DD>main loop, 233-235<DD>support routines, binary tree, 240-242</DL><DD>LZW, 262-263, 270-271</DL><DD>compression ratios, 7, 529<DD>compress_range() function (FRAC.C), 475-476<DD>Compton’s, 213<DD>Compuserve Information Service, 24, 210<DD>constants, in LZSS, 228-229<DD>Consultive Committee for International Telegraph and Telephone (CCITT), 22, 326, 528<DD>Contractive Mapping theorem, 460<DD>ContractNode() routine (LZSS), 240-241<DD>convert_int_to_symbol() routine<DL><DD>arithmetic coding, 124-125, 131, 135-136<DD>statistical modeling, 160-161</DL><DD>Cosine Transform Matrix, 333-335<DD>count_bytes() routine<DL><DD>arithmetic coding, 128<DD>HUFF.C, 56</DL><DD>CPT (compression program), 25<DD>CPU, and arithmetic coding, 16, 17<DD>Cyclical Redundancy Check (CRC), 529</DL><P><FONT SIZE="+1"><B>D</B></FONT></P><DL><DD>DAC. <I>See</I> digital-to-analog converter<DD>data structures, in highest-order modeling, 166-169<DD>DCLZ, 211<DD>DCT. <I>See</I> Discrete Cosine Transform<DD>DCT.C, 345-370<DL><DD>code for, 357-370<DD>compression module, 346-348<DD>expansion algorithm, 353-354<DD>forward DCT routine, 349-350<DD>initialization of, 348-349<DD>input codes, 355-356<DD>OutputCode() routine, 351-353<DD>ReadDCTData() routine, 354-355<DD>WriteDCTData() routine, 350-351</DL><DD>decode_string() routine (LZW), 272-273<DD>DecodeSymbol routine (adaptive Huffman coding), 91<DD>decompression algorithms<DL><DD>adaptive Huffman coding, 91-92, 101<DD>arithmetic coding, 125-126<DD>DCT.C, 353-354<DD>fractal images, 467-469, 477<DD>LZ77, 218-219<DD>LZSS, 242-244<DL><DD>potential improvements to, 243-244</DL><DD>LZW, 264-270, 271-273<DL><DD>implementation, 267<DD>tree maintenance and navigation, 268-270<DD>undefined code, problem with, 266-267</DL></DL><DD>Delete files command (CARMAN), 383<DD>DeleteString() routine (LZSS), 238-240<DD>dictionaries, 530<DD>dictionary-based compression, 20, 201-214<DL><DD>adaptive methods with, 203-207<DD>example (QIC-122), 204-207<DD>ARC, 209<DD>COMPRESS (program), 208<DD>example of, 201-202<DD>general-purpose programs, 210-211<DD>with graphics files, 322-323<DD>hardware-specific programs, 211-212<DD>history of, 207-208<DD>patented software, 212-214<DD>static dictionaries, 202-203</DL><DD>differentiation modulation, 324-325<DD>digital audio<DL><DD>low-pass filters in, 293-294<DD>PC-based sound, 297-299<DD>and range of hearing, 290<DD>replay of sound, 293<DD>and sampling, 291-292, 294-297<DD>waveforms, 290-291</DL><DD>Digital Signal Processor (DSP), 22<DD>digital-to-analog converter (DAC), 293, 295, 297, 311-312<DD>Discrete Cosine Transform (DCT), 22-23, 327-331, 529<DL><DD>code, 357-370<DD>and entropy encoding, 343-344<DD>implementing, 332-333<DD>matrix multiplication, 333-335<DD>inverse, 330, 356-357<DD>output of, 335-336<DD>and quantization, 337-340<DD>sample program, utilizing, 345-370<DL><DD>compression module, 346-348<DD>expansion algorithm, 353-354<DD>forward DCT routine, 349-350<DD>initialization, 348-349<DD>input DCT codes, 355-356<DD>input format, 346<DD>Inverse DCT, 356-357<DD>OutputCode() routine, 351-352<DD>ReadDCTData() routine, 354-355<DD>WriteDCTData() routine, 350-351</DL><DD>two-dimensional, 330<DD>usefulness of, 331-332<DD>and zig-zag sequence, 341-343</DL><DD>Discrete Fourier Transform, 335<DD>Disk Doubler, 211<DD>DOS, compression programs in, 23-24<DD>Dr. Dobb’s Journal, 7<DD>DSP. <I>See</I> Digital Signal Processor</DL><P><FONT SIZE="+1"><B>E</B></FONT></P><DL><DD>8-bit characters, 4<DD>encode_ symbol() routine<DL><DD>adaptive Huffman coding, 91-95<DD>arithmetic coding, 131</DL><DD>encoding, 528<DD>entropy, 13-14, 530<DD>entropy encoding, 343-344<DD>ERRHAND.C, 53-54<DD>ERRHAND.H, 53<DD>errors, quantization, 295<DD>escape codes, 530<DL><DD>adaptive Huffman coding, 83-84<DD>ARITH-1.C., 159-161<DD>ARITH-N.C, 164-165</DL><DD>expansion algorithms. <I>See</I> decompression algorithms<DD>Extract() routine (CARMAN), 405-408</DL><P><FONT SIZE="+1"><B>F</B></FONT></P><DL><DD>Fano, R. M., 27<DD>Fast Fourier Transform (FFT), 22, 327-329<DD>Fibonacci function, 84-85<DD>FIF (Fractal Image Format), 459<DD>filters, low-pass, 293-294<DD>find_map() function (FRAC.C), 476-477<DD>FindNextNode() routine (LZSS), 241-242<DD>finite-context modeling, 154<DD>first pass, 155<DD>Fisher, Yuval, 458, 510<DD>floating-point math, with arithmetic coding, 118<DD>flush_arithmetic_encoder() routine (arithmetic coding), 133<DD>flushing, with highest-order modeling, 170<DD>Forward DCT() routine, 349-350<DD>FRAC.C, 471-505<DL><DD>classify_domains() function of, 474-475<DD>code, 477-505<DD>compress_init() function, 473-474<DD>compression results, 506-509<DD>compress_range() function of, 475-476<DD>find_map() function of, 476-477<DD>main compression module, 472-473<DD>traverse_image() function of, 477</DL><DD>fractal image compression, 457-458<DL><DD>decoding, 467-469<DD>history of, 457-459<DD>iterated function systems, 459-463<DL><DD>image compression with, 461-467<DD>mathematics of, 460-461</DL><DD>partitioned iterated function systems, 463-467<DD>patent concerns, 509-510<DD>and resolution independence, 469-471<DD>sample program, 471-509<DL><DD>code, 477-505<DD>decompression module, 477<DD>domain classification in, 474-475<DD>image partitioning in, 475-476<DD>initialization function, 473-474<DD>main compression module, 472-473<DD>optimal affine maps, finding, 476-477<DD>results, compression, 506-509</DL></DL><DD>Fractal Image Format (FIF), 459<DD>FractInt program, 458<DD>freeware, 298-299, 530<DD>function body, 6-7<DD>function declarations, parameters in, 43-44<DD>function prototypes, 4-6</DL><P><FONT SIZE="+1"><B>G</B></FONT></P><DL><DD>G.721 algorithm, 318-319<DD>ghost buffers, 244<DD>Gibb’s phenomenon, 457<DD>GIF format, 210, 212-213<DD>Gilchrist, Jeff, 25<DD>global variables, in LZSS, 229-231<DD>Graphical User Interface (GUI), 321<DD>graphics compression<DL><DD>fractal compression. <I>See</I> Fractal image compression<DD>lossy. <I>See</I> Lossy graphics compression</DL><DD>Group 3 FAX, 530<DD>GS.C, 346<DL><DD>code, 370-372</DL><DD>GSDIFF.C, 372-375, 466-467<DD>GUI (Graphical User Interface), 321</DL><P><FONT SIZE="+1"><B>H</B></FONT></P><DL><DD>hard disk, and dictionary-based compression, 211<DD>hashing function (LZW), 268-269<DD>header CRC, 388-390<DD>headers, in CARMAN, 384-390<DD>hearing, range of, 290<DD>Hewlett-Packard, 211<DD>higher-order modeling, 153-154<DD>highest-order modeling, 162-170<DL><DD>escape possibilities, 164-165<DD>flush code for, 170<DD>memory and implementation of, 170<DD>order(-1) and (-2) tables for, 169-170<DD>and redesign of data structures, 166-169<DD>scoreboarding with, 165-166<DD>updating ARITH-1.C. code for, 163-164</DL><DD>HUFF.C⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -