gearshape

Contains watermark embedding

TANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUBTANI AYOUB

New algorithm bresenham.

matlab带噪声周期信号的自相关运算代码仿真有图(autocorrelation matlab periodic signal with noise)

64QAM调制MATLAB代码，其中QAM_64为主程序(MATLAB code of 64QAM modulation)

说明：  《MatrixVB_基于Matlab与VB的计算引擎》，一篇关于matrixvb入门的期刊文章(&quot MatrixVB_ calculation based on Matlab and VB engine&quot , an entry on the articles in the journals matrixvb)

利用y(n)=x(n)-y^2(n-1)+y(n-1)， x(n)=au(n),u(n)为阶跃序列，这一算法，计算了0.001-0.999之间数字的平方和，并给出图形，并与matlab自身的函数power进行了比较，给出了差值的图形(Calculates the square sum of the Numbers between 0.001 0.999, and the graphics is given, and with the function of matlab power are compared, and the difference of the graphics is presented)

详细模拟了调频系统 采用DPSK调制 包含跳频系统的全部模块(Detailed simulation of the FM system using DPSK modulation frequency hopping system includes all of the modules)

采用栅格对机器人的工作空间进行划分，再利用优化算法对机器人路径优化，是采用智能算法求最优路径的一个经典问题。目前，采用蚁群算法在栅格地图上进行路径优化取得比较好的效果，而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。 利用遗传算法处理栅格地图的机器人路径规划的难点主要包括：1保证路径不间断，2保证路径不穿过障碍。 用遗传算法解决优化问题时的步骤是固定的，就是种群初始化，选择，交叉，变异，适应度计算这样，那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)

It is used to find shortest path between the nodes