-
Jepg2000的压缩
Jepg2000的压缩解压(Jepg2000 compression decompression)
- 2020-07-09 14:48:55下载
- 积分:1
-
HuffmanCompress
基于哈弗曼树的压缩软件,可压缩文字和位图。(Huffman tree based compression software, compressible text and bitmaps.)
- 2014-04-23 20:09:34下载
- 积分:1
-
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
-
MyBitMapCompress
说明: 一个简单的32位位图压缩算法,基本思想是,扫描像素点,后面有雷同的就记下重复次数。(A simple 32-bit bitmap compression algorithm, the basic idea is to scan pixel, behind identical repetitions on the record.)
- 2010-04-13 22:43:43下载
- 积分:1
-
fft_wang
这是一个自己写的关于fft变换的快速源程序,可以达到很高的性能。(This is an fft transform himself wrote about the rapid source, you can achieve high performance.)
- 2009-11-23 15:33:36下载
- 积分:1
-
reliability-assessment
电力输发电系统可靠性评估程序 解析法 系统数据在压缩包里(Power transmission and generation system reliability evaluation process analytical method system data compression bag)
- 2020-09-01 09:28:09下载
- 积分:1
-
reliability-assessment
电力输发电系统可靠性评估程序 解析法 系统数据在压缩包里(Power transmission and generation system reliability evaluation process analytical method system data compression bag)
- 2020-09-01 09:28:09下载
- 积分:1
-
xinxi
哈夫曼编码,基于MFC开发。哈夫曼编码为熵编码中的最佳方法之一,广泛用于各种数据压缩技术中。-Huffman coding, based on the MFC. Huffman coding for entropy coding one of the best ways, for a wide variety of data compression technology.
- 2011-07-12 10:33:01下载
- 积分: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
-
haffman
对输入的字符进行哈弗曼编码,生成编码表,计算压缩比等(haffman tree)
- 2011-08-30 14:10:52下载
- 积分:1