WP_DFIG

J-LINK V8 出厂固件烧录与修复文件，压缩包中的.bin烧录文件为破解文件烧录即可使用，且附带烧录教程、破解教程(J- LINK V8 factory firmware replication and repair files, compressed package. In the buffer bin file for solving file replication can be used, and the supplementary burning tutorials, crack tutorial)

说明：  一篇关于压缩感知的经典文章，压缩感知（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.)

输入两个正整数m和n，求其最大公约数和最小公倍数(Enter two positive integers m and n, can seek the common denominator and least common multiple)

利用gzip.dll解压http请求返回的内容。内附gzip.dll。参考网上资料自己写的VB6工程源码。自己编译EXE的时候注意把gzip.dll释放到exe所在目录。(Use gzip.dll to decompress the content returned by HTTP request. Gzip.dll is attached. Refer to the VB6 project source code written by myself.)

基于类函数形函数的参数化建模方法，适用于气动设计和优化(Class/Shpae Transform method)

BWT压缩方法描述，是一种被bzip2等数据压缩技术所使用的算法(The Burrows–Wheeler transform (BWT, also called block-sorting compression), is an algorithm used in data compression techniques such as bzip2.)

这是一个不错的图像压缩的Matlab程序,希望能对你有所帮助.(This is a good image compression Matlab procedures in the hope that you can help.)

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

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

压缩传感中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.)