pv0

说明：  生成涡旋光有多种方式，空间光调制，涡旋相位板，还有利用叉状光栅衍射法。此程序是叉状光栅生成程序，可以用来产生叉状光栅。(There are many ways to generate vortex light, such as spatial light modulation, vortex phase plate, and fork grating diffraction. This program is a generation program of fork grating, which can be used to generate fork grating.)

瑞利衰落信道（Rayleigh fading channel）是一种无线电信号传播环境的统计模型。这种模型假设信号通过无线信道之后，其信号幅度是随机的，即“衰落”，并且其包络服从瑞利分布。(Rayleigh fading channel (Rayleigh fading channel) is a radio signal propagation environment, the statistical model. The model assumed that after the signal through the wireless channel, the signal amplitude is random, that is, " fading" and subject to its Rayleigh distribution envelope.)

有关matlab的基本运算函数，基本绘图指令（平面和立体），pdf格式的matlab循序渐进是一本对初学者很有帮助的书(Related to basic computing matlab function, basic drawing commands (plane and three-dimensional), pdf format matlab is a gradual one pairs of helpful books for beginners)

Pilot Based Estimation in OFDM system which discusses the comb estimation technique and the interpolation used

数值方法解方程组AX=B（LU分解），过程分3步，首先，分解系数矩阵A=LU，然后，解LY=B，最后再求UX=Y 另一种是直接求解的（2.1）(Numerical method to solve the equations AX = B (LU decomposition), 3 step process, first of all, the decomposition of the coefficient matrix A = LU, then, Xie LY = B, and finally seek UX = Y another directly solving (2.1 ))

基于matlab的曲线标记，实现了不同曲线的正确标记，以直观体现数据的规律。(Different curve matlab curve mark the correct mark, the law of visual expression data.)

matlab 概率统计之经典算法教程matlab tutorial probability statistics of the classical algorithm(Probability and Statistics of the classical algorithm matlab tutorials matlab tutorial probability statistics of the classical algorithm)

一个关于matlab的PDF文件，很好的，在网上很难得的，讲的很好(Matlab on the PDF file, very good, in-line hard to come by, said good)

说明：  智能控制程序，适合看智能控制[刘金琨编著][程序源代码](无)

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).