ivsdk

一个压缩软件的SDK，有例子！ 请大家尝试！(a packer software sdk)

压缩与解压缩类；压缩文件至.zip包内，增加文件至.zip包内，及解压缩相关操作。(zip and unzip。)

Deflate压缩算法源码，使用C++编写(Deflate compression algorithm source code, the use of C++ to prepare)

对输入的字符进行哈弗曼编码，生成编码表，计算压缩比等(haffman tree)

说明：  对流数据的压缩，主要针对二进制的数据代码进行各种长度宽度的压缩。(convection data compression, mainly with regard to the binary code of various length width of the compression.)

w_ipp-sample-data-compression，Intel，IPP函数库，文件数据快速压缩解压缩工具包。可以进行数据加密解密告诉处理( W_ipp-sample-data-compression, Intel, IPP library, file compression and decompression tool for fast data packet. You can tell the encryption and decryption of data processing)

哈夫曼编码(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).)

此EA是本人长期实战总结的一个稳定盈利的利器，现在在期适用交果良好。(This EA is my long-term combat summary of a stable profit tool, now in the application of good fruit.)

非常好的视频压缩filter,可以实现mpeg2 mpeg1的视频压缩，用户可以自己选择码率(very good video compression filter can achieve mpeg1 mpeg2 video compression, Users can choose Rate)

一种改进的方案，它针对硬故障集的特点利用指示频率连续长度码(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. )