G

 用霍夫曼编码实现的简单的文本压缩解压缩C++源程序

设电文字符集D及各字符出现的概率F如下： D={a，b，c，d，e，f，g，h}（字符数n=8） F={5，29，7，8，14，23，3，11}( ) 编写完成下列功能的程序： ①构造关于F的Huffman树； ②求出并打印D总各字符的Huffman编码。 程序结构： 类型说明； 构造Huffman树的函数：Huffman_tree(H[m+1])； 求Huffman编码的函数：Huffman_code(code[n+1])； main() { 变量说明； 输入字符集D及频率F； 调用Huffman_tree(H)； 调用Huffman_code(code)； 打印编码； Y 继续？ N 停止 }

说明：  著名压缩算法的实现，能够实现各种基本功能，适合学习！(famous compression algorithm to achieve to achieve basic capabilities for learning!)

SOMP算法，该算法主要是应用在压缩传感中的信号恢复算法。(Compressed Sensing)

本程序是交流压缩机的驱动程学，压缩机为三洋，功率为10KW,用的是东芝的IPM(This procedure is the exchange of compressor-driven learning process, the compressor for the Sanyo, power 10KW, using the IPM Toshiba)

video compression using matlab

比较全面的无损压缩算法集合，编译通过，可以运行(More comprehensive collection of lossless compression algorithm, the compiler is passed, can run)

说明：  这是多种群遗传算法的matlab源码，针对其函数化问题进行了深入讨论，下载后可直接运行查看仿真结果(This is the matlab source code of multi population genetic algorithm. The problem of its functionalization is discussed in depth. After downloading, the simulation results can be viewed directly)

Docuemtns,Hot Documents

Huffman 编码是第一个实用的无损压缩编码技术，经过了多年的不断改进，已经形成了系统的理论和方法。目前主要有两种类型的Huffman编码方式，即静态Huffman编码和动态Huffman编码。Huffman编码有着广泛的应用，但是不再是压缩算法的全部，而是被当作最终的编码方法。(Huffman coding is the first practical lossless compression coding technology, after years of continuous improvement, has formed a system of theories and methods. There are currently two types of Huffman encoding, namely, static and dynamic Huffman coding Huffman coding. Huffman coding has been widely used, but the compression algorithm is no longer all, but rather be treated as the final coding.)