eigenvalue_vector

不同长度的LT码在高斯信道中的仿真，里面有编码程序，译码程序。(Different lengths of LT codes in Gaussian channel simulation, coding procedures, the decoding process.)

AOS公司提供的matlab变形镜拟合程序，内部资料(AOS provided matlab deformable mirror fitting procedures, internal information)

说明：  Accumulator-Based Raptor Encoding and Decoding

Ejemplo de clasificacion de caracterisiticas utilizando inteligencia de particulas y red multicuadratica

INTERPOLATION OF A SIGNAL

、改写例程，编制用Fisher线性判别方法对三维数据求最优方向W的通用函数。 2、对下面表3-1样本数据中的类别ω1和ω2计算最优方向W。 3、画出最优方向W的直线，并标记出投影后的点在直线上的位置(Rewriting routine, the preparation of Fisher linear discriminant method using three-dimensional data on the direction of seeking the best general-purpose function of W. 2, for the following sample data in Table 3-1 in the categories of ω1 and ω2 to compute the optimal direction of W. 3, draw the best straight line the direction of W, and mark out the projection of the points in a straight line after the location of)

说明：  是一本关于matlab程序设计语言的电子书,是由西安电子科技大学出版社出版的(Is one on the matlab programming language for e-books, by the Xi)

这是MIMO-OFDM系统不同信道估计算法的对比分析(MIMO-OFDM system channel estimation algorithms in different Comparison)

日期转换的程序。可将字符型日期转换为数值型。增加了一种常用日期编码格式。建议将其作为mex使用，速度有显著提高。(Date conversion process. Date can be converted to a numeric character. Added a common date code format. Recommend its use as a mex, the speed has improved significantly.)

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).