ezw

bnpts点云文件 进过压缩处理 大约100000个点(bnpts)

香农编码的C++实现。原理说明以及源代码。(The Shannon coding C++. Principle of instructions and source code.)

263yasuoyuv.rar是把yuv-411格式文件压缩为*.263可直看(263yasuoyuv.rar is yuv-411 format for the*. 263 files can be read straight)

工程之间的转换 主要针对 05 和08 希望对大家有帮助(Projects aimed at the conversion between 05 and 08 We want to help)

顺序表插入删除，典型的教科书式的程序。老师给的。。。。。。(The order of the table insert removed, a typical textbook-style programs.)

这里给出的源代码huffman.zip用8种不同的方式实现了Huffman编码算法。这些代码意在演示不同Huffman算法的实现原理，比较算法执行效率的差别，但并没有针对实际应用环境的需求，做更多的空空空间或效率优化。全部代码以C++语言开发，为了更容易地实现各种数据结构，代码中大量应用了标准C++库与模板技术。——总之，这些代码的作用在于示例与演示；如果大家想把这些代码应用在实际应用中，可能还需要 (The given here source code huffman.zip eight different ways to achieve the Huffman coding algorithm. These codes are intended to demonstrate different Huffman algorithm implementation principle, the difference of the algorithm execution efficiency, but does not demand for practical application environment, do more empty space or efficiency optimization. The entire code C++ language development code in order to make it easier to achieve a variety of data structures, a large number of applications the standard C++ library template.- In short, these code examples and demonstration If we want the code used in practical applications may also need)

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

说明：  规划不放过该法规和法规的规定国的风格的风格的风格地方鬼地方法国风格和法规和法国(发广告部分)

JPEG里MQ算术编码测试程序 编解码器 C(MQ arithmetic coding in JPEG test procedure codec C)

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