OFDM

Consultantr assistance system to help manage client

CNN - Convolutional neural network class This project provides matlab class for implementation of convolutional neural networks. Deep Neural Network It provides deep learning tools of deep belief networks (DBNs). myCNN is a Matlab implementation of convolutional neural network (CNN).

统计分析 数据分析中关于回归分析的源代码，非常的全面！(The statistical analysis of source code, data analysis, regression analysis is very comprehensive! )

基于matlab的电压源型整流器的仿真，可以通过最后的波形得出结论(Type of voltage source rectifier based on matlab simulation, can pass the final waveform concluded )

很好用的模拟退火Matlab工具箱，带有英文说明书 (Simulated Annealing Tools Software)

matlab实用教程 里面是doc格式的 很详细(failed to translate)

说明：  Gerchberg–Saxton（GS）算法是一种迭代算法，用于检索通过传播函数（如傅里叶变换）相关的一对光分布（或任何其他数学上有效的分布）的相位，前提是它们在各自光学平面上的强度已知。(The algorithm is an iterative algorithm for retrieving the phase of a pair of light distributions.)

Matlab中没有现成的Hermite插值函数，必须编写一个M文件实现插值。 设n个节点的数据以数组x0 （已知点的横坐标）， y0（函数值）， y1（导数值）输入（注意Matlat的数组下标从1开始）， m个插值点以数组x 输入，输出数组y 为m 个插值。编写一个名为hermite.m的M文件。 (Matlab is not off-the-shelf Hermite interpolation function, we must realize the preparation of a document M interpolation. N nodes for the data to an array x0 (known point of abscissa), y0 (function value), y1 (numerical derivative) input (note the subscript Matlat array starting at 1), m to the array of interpolation points x input and output array y for m months interpolation. Hermite.m the preparation of a M-file.)

说明：  利用MATLAB编写的该代码,可以将数据写入到TXT文件中,里面还赋有说明(Prepared by the use of MATLAB code, the data can be written to TXT file, which is also endowed with that)

说明：  利用Dijkstra算法来求网络图的最短路径，找到从起点P1到终点Pn的最短路径，由于上述算法使用了连接线中点的条件，不是整个规划空间的最优路径，然后利用遗传算法对找到的最短路径各个路径点Pi (i=1,2,…n)调整，让各路径点在相应障碍物端点连线上滑动(Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide)