1

信号功率谱分析，方法三、四，已在此详细编写(Signal power spectral analysis, methods, three, four, has been prepared in detail here)

选择使用matlab对图像进行四叉树分解，并且显示稀疏矩阵的结果。(Choose to use the matlab quadtree decomposition of the image, and sparse matrix results.)

泰勒级数展开算法是需要初始估计位置的递归算法，在每一次的递归中通过求解TDOA测量误差的局部最小二乘来改进估计的位置。 本程序基于MATLAB，对泰勒级数展开算法进行了仿真。初始位置的选取很重要，建议和其他简单的算法进行协同，对信号源位置进行定位。 希望对研究信号源定位的同志有所帮助。(Taylor series expansion algorithm is the need to estimate the location of the initial recursive algorithm, in every recursive TDOA measurement error by solving the partial least squares to improve the position estimate. The program is based on MATLAB, the Taylor series expansion algorithm for the simulation. The selection of the initial position is very important, the proposed algorithm and other simple coordination, to locate the signal source location. Want to locate the source of research help comrades.)

MATLAB 嵌入式代码说明文档，希望能帮助大家(MATLAB 嵌入式代码说明文档)

说明：  PWM整流器仿真，稳压效果好，采用svpwm调整，pll锁相环并网，电流波形纹波小，响应快(Simulation of PWM rectifier shows that the effect of voltage stabilization is good, SVPWM adjustment is adopted, PLL phase-locked loop is connected to the grid, the current waveform ripple is small and the response is fast)

卷积码的编码器是由一个有k个输入端、n个输出端、m节移位寄存器所构成的有限状态的有记忆系统，通常称它为时序网络。(A convolutional code encoder is composed of a k-th input terminal of the n output terminals, m section shift register constituted by a finite state memory system, the usually call timing network.)

一个用matlab实现的wmv解码源程序，对进行wmv开发的初学者非常有用(an achievable with Matlab source decoder wmv, wmv right for the development of very useful beginners)

这是一个用k均值聚类的matlab 程序 程序对高维数据利用k均值进行了聚类(This is a k-means clustering matlab program procedures for high-dimensional data for the use of k-means clustering)

name: UTKARSH DESHMUKH guide: A.S.ABHYANKAR SIR this code is for wavelet transform using the lifting scheme. this code does inplace computations and is hence memory efficient.

ES is a symmetric block cipher. The same key is used to encrypt and decrypt the message. The plain text and the cipher text are the same size. The Aes algorithm works as follows: Convert to state array: This step consists of conversion on the matrix onto a state array operating with the sbox. Transformations (and their inverses) AddRoundKey: Computing the round key for each round. SubBytes: Substituting by bytes from Sbox. ShiftRows: Shifting of rows. MixColumns: Exor operation on columns. Key Expansion: Expanding the key to be used on next round.