pujianfa

量子计算与量子优化算法的部分程序，感兴趣的可以下载学习~~(Quantum computing and quantum optimization algorithm part of the program interested you can download to learn ~ ~)

统计稀疏分解（SSDP）欠定盲分离MATLAB仿真程序。能在接收天线个数小于源信号个数时，仅仅利用观察信号恢复出源信号。(Statistics sparse decomposition (SSDP) underdetermined blind separation of MATLAB simulation program. In the number of receiving antennas is less than the number of source signals, using only the observed signal to recover the source signals.)

matlab about compression

matlab mex code for lattice prediction

说明：  此源程序是复杂网络中参数聚类系数的计算机程序，很有用的(This source is a complex network parameter clustering coefficient computer program, very useful)

ezw（嵌入式零树小波）编码解码 matlab程序(ezw matlab)

离散函数matlab基本用法卷积与循环卷积描述及连续信号幅度谱包络(Discrete convolution function matlab basic usage and circular convolution description and continuous signal amplitude spectral envelope)

MATLAB的GUI教程,GUI的基本说明与操作以及部分实例,内容为英文(MATLAB GUI guides, a basic description of the GUI and operating, and some examples, says English)

matlab工作界面，运算符与操作符的含义和用法，建模和编程的一些实例(Matlab interface, the operator and the meaning and usage of the operator, the modeling and programming examples)

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. () Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. )