登录
首页 » Visual C++ » lzari压缩算法

lzari压缩算法

于 2005-03-06 发布 文件大小:28KB
0 267
下载积分: 1 下载次数: 28

代码说明:

  这是一个基于LZARI算法的数据压缩的类.Haruhiko Okumura 于1989年7月4日用C语言写实现了这个算法.但是上面用到了一些全局或静态的变量,在MFC下用起来很不方便.作者把它改写成了一个C++类,使它可以方便的压缩和解压缩。(LZARI algorithm based on the type of data compression. Haruhiko SAP in 1989, July 4 C language daily wrote realization of this algorithm. But above uses some static or global variables, using the MFC which are very convenient. Authors rewrite it became a category C, it can be to facilitate the compression.)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 263yasuoyuv
    263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)
    2008-06-12 20:20:49下载
    积分:1
  • GZIP例子
    利用gzip.dll解压http请求返回的内容。内附gzip.dll。参考网上资料自己写的VB6工程源码。自己编译EXE的时候注意把gzip.dll释放到exe所在目录。(Use gzip.dll to decompress the content returned by HTTP request. Gzip.dll is attached. Refer to the VB6 project source code written by myself.)
    2020-06-22 07:00:02下载
    积分:1
  • DS4
    设电文字符集D及各字符出现的概率F如下: D={a,b,c,d,e,f,g,h}(字符数n=8) F={5,29,7,8,14,23,3,11}( ) 编写完成下列功能的程序: ①构造关于F的Huffman树; ②求出并打印D总各字符的Huffman编码。 程序结构: 类型说明; 构造Huffman树的函数:Huffman_tree(H[m+1]); 求Huffman编码的函数:Huffman_code(code[n+1]); main() { 变量说明; 输入字符集D及频率F; 调用Huffman_tree(H); 调用Huffman_code(code); 打印编码; Y 继续? N 停止 }
    2015-06-06 16:41:33下载
    积分:1
  • Renderer
    this is renderer function
    2009-11-15 21:17:44下载
    积分:1
  • PackerSDK
    一个压缩软件的SDK,有例子! 请大家尝试!(a packer software sdk)
    2011-11-14 01:15:50下载
    积分:1
  • FDR-COMPRESS
    一种改进的方案,它针对硬故障集的特点利用指示频率连续长度码(FDR码)进行二次编码压缩。该方法充分利用测试集中无关位较多而测试模式之间变化位较少的特征,应用贪心算法对预先计算的测试集进行了重新排序,尽可能的使相邻的向量间具有最少的不同位,排列成一个最佳的差分向量序列,然后应用FDR码对差分向量序列进行编码,最后对压缩结果重新分块,按照一次压缩的流程进行二次压缩。在解压时,使用片上解压电路解压,能高效地还原出原测试集。最后通过对Soc部分标准电路硬故障集的测试结果显示,本方案具有较好的压缩率。(a new improved method was proposed in the paper,the method using Frequency-Directed Run-length(FDR codes)coding for the twice aimed at hard-fault. It fully takes advantage of the characters that there are many don’t-care bits in the test set but a few different bits between the test patterns, Then it applies the greed calculate way to sort the precomputed test sets and make the close together vector have the least different sites possibly. It uses the FDR codes to coding the vectors,then blocks the results and uses the FDR codes to compress for the second time. Decompression used of on-chip circuit extract unpack,it will be deoxidize the original test efficient.using the hard-fault to compress and the experimental results prove that the improved coding method of this paper has the better compression ratios has been proved at last. )
    2009-05-12 14:32:23下载
    积分:1
  • arithmetic
    有关算术编码对文本压缩的程序在c++环境中实现(about arithmetic compressed)
    2013-11-28 23:19:16下载
    积分:1
  • JPEG2000-library-source-code
    JPEG2000库源代码(最新的JPEG2000标准源代码)(JPEG2000 library source code)
    2012-12-03 21:32:19下载
    积分:1
  • Jpeg
    视音频课程作业,对视频抽帧,对单张图片进行yuv420采样、DCT变化、量化以及反量化、IDCT变化(Jpeg Encoding & Decoding)
    2017-12-15 11:25:46下载
    积分:1
  • jpeg_ls_v2.2
    实现图像的jpeg无损压缩,可以在linux系统下经过交叉编译器编译后在arm上实现,已经写好makefile文件(Realize jpeg image lossless compression, you can linux system through cross-compiler to compile in the arm to achieve, has written makefile file)
    2008-04-21 10:21:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载