New-folder

压缩传感中Orthogonal Matching Pursuit算法的matlab实现以及测试程序，上传者亲自编写，以验证，可放心使用。(The realization of Orthogonal Matching Pursuit (OMP) algorithm via matlab. OMP is a classical algorithm in compressed sensing. The RAR also includes a test program for this algorithm.)

有关算术编码对文本压缩的程序在c++环境中实现(about arithmetic compressed)

法是否是否是发生的方式放松放松佛挡杀佛是(放松放松的发生地发生地发)

WinEYS压缩源码例程，程序结合易语言扩展界面支持库，调用API函数实现压缩解压功能。(WinEYS source compression routines, programs combined with easy language support library expansion interface , call the API function to achieve compression and decompression functions.)

对于哈夫曼编码的仿真，可以计算平均码长、熵、压缩比、编码效率(Simulation of Huffman coding)

实现对图像的lzw压缩编码 得到图像的压缩比以及码长(Lzw realize image compression coding of image compression ratio as well as the code length)

说明：  一篇关于压缩感知的经典文章，压缩感知（Compressed sensing，简称CS，也称为Compressive sampling)理论异于近代奈奎斯特采样定理，它指出：利用随机观测矩阵可以把一个稀疏或可压缩的高维信号投影到低维空间上，然后再利用这些少量的投影通过解一个优化问题就可以以高概率重构原始稀疏信号，并且证明了这样的随机投影包含了原始稀疏信号的足够信息。(A classic article on compressed sensing, compressive sensing (Compressed sensing, referred to as CS, also known as Compressive sampling) different from the modern theory of the Nyquist sampling theorem, which states: the use of a random measurement matrix can be sparse or compressible high-dimensional signal projected to low dimensional space, and then use a small amount of projection by solving an optimization problem to be sparse with high probability to reconstruct the original signal, and prove that random projection of the original sparse signal contains enough information.)

说明：  利用哈夫曼树对简单文件进行压缩和解压缩，对数据的压缩集成(Compression and Decompression of Simple Files Using Huffman Tree)

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

自适应滤波器原理matlab程序(Principle of adaptive filter matlab program)