ComprSrc
所属分类:压缩解压
开发工具:C/C++
文件大小:94KB
下载次数:50
上传日期:2004-11-15 16:30:25
上 传 者:
mistyboy
说明: 包含Lzw,Huff1,Dhuff等等多种压缩算法的源代码包
(contains Lzw, Huff1, etc. Dhuff multiple compression algorithm source code)
文件列表:
AR002 (0, 1999-12-09)
AR002\AR.C (9965, 1992-10-17)
AR002\AR.H (1974, 1990-08-15)
AR002\DECODE.C (1118, 1992-10-17)
AR002\ENCODE.C (8018, 1992-10-17)
AR002\HUF.C (7105, 1992-10-17)
AR002\IO.C (2365, 1992-10-17)
AR002\MAKEFILE (748, 1992-10-17)
AR002\MAKETBL.C (1525, 1992-10-17)
AR002\MAKETREE.C (2630, 1992-10-17)
ASH (0, 1999-12-09)
ASH\ARITH.C (7788, 1992-01-15)
ASH\ARITH.H (565, 1992-01-15)
ASH\COMP.H (1180, 1992-01-15)
ASH\COMPRESS.C (3478, 1992-01-15)
ASH\EXPAND.C (3628, 1992-01-15)
ASH\FILES.C (3875, 1992-01-15)
ASH\FILES.H (347, 1992-01-15)
ASH\MAKE.BAT (130, 1992-10-17)
ASH\MODEL.C (33986, 1992-01-15)
ASH\TEST.C (976, 1992-01-15)
COMP (0, 1999-12-09)
COMP\BITIO.C (5713, 1990-06-03)
COMP\BITIO.H (435, 1990-05-23)
COMP\CODER.C (6198, 1990-06-03)
COMP\CODER.H (1394, 1990-05-22)
COMP\COMP-1.C (4399, 1990-06-02)
COMP\COMP-2.C (7002, 1990-06-02)
COMP\EXPAND-1.C (4245, 1990-06-02)
COMP\EXPAND-2.C (4786, 1990-06-02)
COMP\MAKE.BAT (484, 1992-10-17)
COMP\MODEL-1.C (3193, 1990-06-02)
COMP\MODEL-1A.C (4562, 1990-05-25)
COMP\MODEL-2.C (27727, 1990-05-25)
COMP\MODEL-2A.C (6196, 1990-05-25)
COMP\MODEL.H (657, 1990-05-25)
COMP\READ.ME (2093, 1992-10-17)
FIN (0, 1999-12-09)
FIN\COMP2.ASM (3561, 1991-04-29)
... ...
1. The problem was caused by an overflow in the arithmetic coder
due to long strings of repeated characters. This has been
fixed.
2. The program now tests for repeated strings and bypasses the
scan procedure. This has improved the performance significantly
for the slowest files.
3. I have included all the source files and executables. Most of
the changes are in MODEL.C. I have made some minor changes to
some of the other routines, such as correcting spelling mistakes.
4. I have checked the underflow situation at end of file, and I am
still convinced that my method works. The version of the
arithetic coding algorithm published in the CACM presents random
bits to the decoder at end of file, so that the final value output
by the coder must include enough bits to allow the final symbol
to be resolved no matter what follows. This means outputting the
underflow bits plus two more to ensure the input value is bracketed
by the high and low limits.
I get around this problem by returning zeroes after the decoder
detects end of file.
Thank you for the chance to fix the problems.
Charles.
近期下载者:
相关文件:
收藏者: