graphene

QPSK system simulation not working

关于matlab实现动态规划的逆序算法的源程序(dynamic programming )

paper file from the tool box of some matlab code

独立分量分析，利用此程序可以提取独立分量(independent component analysis, the use of this procedure can be extracted ICA)

matlab工具箱函数汇总，对matlab编程非常有用！(Matlab toolbox function)

开关磁阻电机的角度位置控制simulink模型(angular position control for SRD)

此代码是有关QAM的MATLAB的仿真，包括4QAM,16QAM,64QAM。还有其误码率的仿真(This code is related to the MATLAB simulation QAM, including 4QAM, 16QAM, 64QAM. Also its BER simulation)

bessel函数计算方法，源于matlab算法书中，比较权威(bessel function, method of calculation from the book matlab algorithm to compare the authority of)

tcsc location determination

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