互相关求时延差

thesis in matlab regarding performance of wimax in multifade envoirnment

该压缩包实现二维的DCT变换和逆DCT变换，可以对图像做DCT变换和逆DCT变换，实现非常简洁，速度很快。(the compressed 2D DCT and the inverse DCT. Images can be done DCT and inverse DCT achieve a very simple, very fast.)

program to interface nwith gsm modem

人脸识别，包含人脸库，gui界面程序，识别程序(Face recognition, including face , gui interface program, recognition programs)

最优决策——用几个matlab编程的实例阐述分支定界法的思想是：首先确定目标值的上下界(Optimal decision-making- matlab programming with some examples of the branch and bound method is the idea: First, determine the target of the upper and lower bounds)

ripper matlab code for classification

形态学滤波器 matlab程序，主要用于特征提起、信号处理(Morphological filter matlab program, mainly for the characteristic lift, signal processing)

purebasic的入门书籍，虽然用purebasic的人很少，甚至分类都没他。不过这个语言还是不错的。(purebasic entry books, although very few people with purebasic, or even no his classification. However, the language is good.)

实现雷达系统中7位巴克码的调相信号的回波接收系统的matlaB程序(Radar system seven Barker code modulation signal receiving system matlaB echo procedures)

说明：  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)