OfdmHpaEffects

使用正弦信号的相乘，然后取阈值，得到的伪随机信号，并且有频谱分析的结果(Sinusoidal signal is multiplied and then take the threshold to get pseudo-random signal and spectrum analysis of the results)

解决TSP问题的TS算法MATLAB实现，其中加入了变异算法，当然也可以去掉这个步骤，调用TS_TSP(N, inStart, IsBianYi)，N是城市数目，inStart是起始城市的序号，IsBianYi就是选择变异否，如果为0则不要变异，否则就是结合变异算子的TS算法。 至于下面的参数可以自己调： T：总的循环次数； tabulength：禁忌长度； Pby：变异概率； (Solve the TSP problem MATLAB realize TS algorithm, which joined the variance algorithm, of course, this step can also be removed, call TS_TSP (N, inStart, IsBianYi), N is the number of cities, inStart is the serial number of the starting cities, IsBianYi is to choose variation has, if not for the variation of 0, otherwise, it is combined with mutation of the TS algorithm. As for the following parameters can be their own tune: T: total number of the cycle tabulength: taboo length Pby: mutation probability )

上次传的有点小问题，这个已经解决，是基本LMS算法的matlab实现。(previous biographies of some minor problems, this has been resolved, the LMS is the basic algorithm to achieve the Matlab.)

For a given array of angles, determines which are within the bounds, accounting for wrap around

MATLAB句柄操作 经典的 MATLAB句柄操作 经典的(Of MATLAB handle operations classical MATLAB handle operation classic)

MATLAB电机仿真精华50例PDF+源码(MATLAB simulation of the essence of 50 cases of motor PDF+ source code)

说明：  AR自回归线性滤波器法模拟风速时程曲线，MATLAB(AR autoregressive linear filter method is used to simulate wind speed time history curve, MATLAB)

说明：  函数子程序，用于多分辨率分解，使用 A trous 算法； 在分解的过程中，同时给出各级的细节和概貌，它们 和原数据有着同样的长度。(Function, subroutine, for multi-resolution decomposition, the use of A' trous algorithm in the decomposition process, and gives details of all levels and profiles, they have the same and the length of the original data.)

实现机器人避障功能，100个方格内可自己设置障碍区域，程序会自动寻找最短路径。另外附带试验参数(Robot obstacle avoidance function, 100 squares can set up their own regional barriers, the program will automatically find the shortest path. Also included with the test parameters)

算法解决的是有向图中单个源点到其他顶点的最短路径问题(Algorithm to solve it is to map a single source point to the other vertices of the shortest path)