PCAmatlab-

将一个复杂的HashMap转换成的字符传再转换为HashMap(Tranvert the String of HashMAP to HashMAP)

DC_PM_motor in matlab

LMS算法和RLS算法实现阵列信号的波束形成的程序用matlab实现的代码，里面有也有解释说明(LMS and RLS progranm Matlab code.)

帮助你轻松掌握MATLAB 简单方便快捷，如果你想快速提高 (MATLAB help you easily master the easy fast, if you want to rapidly improve)

说明：  包含两种短时傅里叶变换程序跟反变换程序 STFT、stft2是两个短时傅里叶变换程序 istft是短时傅里叶变换逆变换程序(There are two kinds of short time Fourier transform program and inverse transform program STFT and stft2 are two short time Fourier transform programs ISTFT is a short time Fourier transform inverse program)

熵与条件熵，疑义度，噪声熵，互信息等计算程序熵与条件熵，疑义度，噪声熵，互信息等计算程序(Entropy and conditional entropy, equivocation, noise Entropy, mutual information, and procedures for Entropy and conditional entropy calculation, doubt, noise Entropy, mutual information calculation program)

Stable adaptive fuzzy control for MIMO non linear systems 2011

) 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. )

This package implements fast compressed sensing using structurally random matrices (SRM) described in [1] and [2]. As the package is still under development any comments or bug reports are highly welcome.

Data Encryption Standard