Novel-algorithm-for-mimo

这是一个双馈感应电机的矢量控制仿真模型，用的是定子磁链定向(This is the vector control simulation model of doubly-fed induction motor with stator flux orientation)

时频分析工具包，可用于非平稳信号处理，for matlab(This is the Time-Frequency Toolbox, a collection of about 100 M-files , developed for the analysis of non-stationary signals using time-frequency distributions. It consists in groups of signal generation files, processing files and post-processing files (including visualization tools). The toolbox contains numerous algorithms for time-frequency signal analysis, with special emphasis on quadratic energy distributions within Cohen s class and the affine class, including most recent developments based on reassignment. The Time-Frequency Toolbox has been developed by Francois Auger, Olivier Lemoine, Paulo Gonlv and Patrick Flandrin during the years 1995-1996. Later, modifications for Matlab 5 were made available.)

方程的数值解法，包含牛顿迭代法和基于牛顿法的史蒂芬森加速法。matlab实现，注释很详细。(Numerical solutions of equations containing the Newton iteration method and newton-steffensen method.Matlab, very detailed comments.)

本人写的用行程算法进行连通域标记的一段小代码(I used to write the trip algorithm connected domain labeled a small code)

直线电机simulink模型，希望大家提出意见 (Linear motor simulink model )

基于MATLAB图像处理的汽车牌照识别系统，希望对各位大大有些帮助啊啊啊啊(MATLAB image processing based on the vehicle license plate recognition system, we hope to you greatly helpful ah ah ah ah)

应用鸟群算法（PSO）优化全局神经网络权值，可以使用(Applications birds (PSO) algorithm to optimize the overall neural network weights, you can use)

此实验是关于详细的采样定理，有设计与实现及MATLAB程序代码。(It is useful.)

拉格朗日插值法，输入x，y，再输入变量xi，就可以求得yi。(Lagrange interpolation method, the input x, y, and input variables xi, yi obtained.)

这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l me in classical optimization techniques which are based on linear and nonlin ogramming. TSP can be described as follows: Given a numberof cities to v d their distances from all other cities know, an optimal travel route has to und so that each city is visited one and only once with the least possible dista aveled. This is a simple problem with handful of cities but becomes complica the number increases.)