dpsk

说明：  Matlab, 实用程序，matlab实用程序百例，希望对大家学习有所帮助。(Matlab, utility, matlab utility hundred cases, we hope to learn helpful.)

经典光流算法LK改进算法的matlab源码。希望对大家有帮助。(LK classical optical flow algorithm improved algorithm matlab source code. I hope to help.)

两种算法（LMS和RLS）实现CDMA系统盲多用户检测的仿真。结论验证了在加性高斯白招生信道下、同步DS-CDMA系统中接收机应用这两种盲多用户检测算法抑制多址干扰（MAI: multiple access interference）和码间串扰（ISI: inter symbol interference）的能力,仿真实验与理论推导相吻合。实验与理论都表明,RLS性能好于LMS，而LMS计算量明显小于RLS。(This paper discusses two algorithms (LMS and RLS) to achieve blind multiuser detection CDMA system simulation. Conclusion is verified in the Additive White Gaussian noise channel, the synchronous DS-CDMA system receiver applications both blind multiuser detection algorithm to suppress Multiple Access Interference（MAI）and Inter Symbol Interference (ISI) the ability of simulation is consistent with the theoretical. Both experiment and theory show that, RLS’s Performance is better than LMS, and the LMS ‘s computation was significantly less than RLS. )

扩展卡尔曼滤波程序，请大家指教，希望能对大家有所帮助(EKF, please enlighten everyone, we hope to help)

thanx u gav me a nice option to upload and take models

自适应滤波器,LMS最陡下降法的matlab原代码,需要的可以下(Adaptive filter, LMS steepest descent method of matlab source code needed to make)

在matlab环境上 用几何绕射法计算缝隙的辐射场(in Matlab environment using GTD method of the radiation field slot)

基于matlab的迈克尔逊干涉仿真，帮助大家学习光的干涉(Based on the matlab simulation of Michelson interferometers, help you learn the interference of light )

detection corner for harris

说明：  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 　　Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)