-
ZIP
zip压缩源代码，附有整个工程，保证能用，可应用于文件压缩，内存压缩(zip compressed source code, with the whole project, and ensure that use, can be applied to file compression, memory compression)
- 2008-12-15 21:33:12下载
- 积分：1
-
RLE
RLE是一个压缩的算法，里面有算法的C++程序实现。(RLE is a compression algorithm, there are algorithms C++ program)
- 2012-05-30 18:38:33下载
- 积分：1
-
UNZIP
解压缩软件UNZIP的C源程序代码
The decompression software UNZIP C source code(The decompression software UNZIP C source code)
- 2013-03-26 09:36:09下载
- 积分：1
-
TestMQCoder
JPEG里MQ算术编码测试程序 编解码器 C(MQ arithmetic coding in JPEG test procedure codec C)
- 2020-12-06 09:19:22下载
- 积分：1
-
arithmetic
有关算术编码对文本压缩的程序在c++环境中实现(about arithmetic compressed)
- 2013-11-28 23:19:16下载
- 积分：1
-
j-link-The-firmware-fix-pack
J-LINK V8 出厂固件烧录与修复文件，压缩包中的.bin烧录文件为破解文件烧录即可使用，且附带烧录教程、破解教程(J- LINK V8 factory firmware replication and repair files, compressed package. In the buffer bin file for solving file replication can be used, and the supplementary burning tutorials, crack tutorial)
- 2016-02-17 17:43:38下载
- 积分：1
-
HAFUMANSHU
哈夫曼编码(Huffman Coding)，又称霍夫曼编码，是一种编码方式，哈夫曼编码是可变字长编码(VLC)的一种。Huffman于1952年提出一种编码方法，该方法完全依据字符出现概率来构造异字头的平均长度最短的码字，有时称之为最佳编码，一般就叫做Huffman编码(有时也称为霍夫曼编码)。(Huffman encoding (Huffman Coding), also called Huffman Coding, is a way of Coding, Huffman Coding is variable word length Coding (VLC). Huffman in 1952 put forward a kind of coding method, this method is completely based on the characters of the occurrence probability to construct the average length of the shortest code word, sometimes called the best coding, generally is called Huffman coding (sometimes referred to as the Huffman coding).)
- 2016-12-13 00:02:52下载
- 积分：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
-
0904210213
霍夫曼编码的C++实现,输入一组字符串，输出每个字符的编码及整个字符串的霍夫曼编码。(realization of Huffman coding using VC++)
- 2012-04-15 20:52:45下载
- 积分：1
-
Jpeg
视音频课程作业，对视频抽帧，对单张图片进行yuv420采样、DCT变化、量化以及反量化、IDCT变化(Jpeg Encoding & Decoding)
- 2017-12-15 11:25:46下载
- 积分：1
