w_ipp-sample-data

说明：  用单片机来直接驱动步进电机很精确走小步子.(Using single-chip to directly drive stepper motor is very accurate take small steps.)

基于哈弗曼树的压缩软件，可压缩文字和位图。(Huffman tree based compression software, compressible text and bitmaps.)

这里给出的源代码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)

哈夫曼编码，基于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.

Docuemtns,Hot Documents

Jepg2000的压缩解压(Jepg2000 compression decompression)

说明：  文件介绍了x264程序的算法流程表，每个函数的内容详细介绍在里面 (Document describes the algorithm flow chart x264 programs, and detailed description of each function in it)

加密、压缩(The Examples of Encrypt and Compression)

huffman 编码 完陈对指定的文本文件内容进行huffman编码 实现输出(END CHAN huffman encoding text file on the specified content encoding huffman implementation output)

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