Rayleigh-Fading-with-doppler-effect

对超宽带定位的基本原理进行了探讨，重点讨论了经典算法中的非迭代算法和迭代算法，对其优缺点进行了对比分析，并以实例说明了超宽带定位技术的优良性能。(UWB positioning on the basic principle is discussed, focusing on the classical algorithm of non-iterative algorithm and the iterative algorithm, its advantages and disadvantages are compared, and to locate examples of the ultra-wideband technology for excellent performance.)

采用KSVD算法通过训练的方法来构造稀疏过完备字典，在使用时一定要确保已装有ompbox9。可用于语音，图像信号处理等的稀疏字典构造(KSVD algorithm using the method of training to construct the sparse over-complete dictionary, in use, make sure have been installed ompbox9. Can be used for the sparse dictionary construction in voice, image signal processing )

《matlab6.5辅助小波分析与应用例程》一书的源代码("matlab6.5 assisted with the application of wavelet analysis routines," a source code book)

有关傅里叶展开式的程序，速度非常快，而且还有相关的实例说明。(About Fourier expansion program, very fast, but also related examples.)

DV-hop算法实现，实现无线传感器的非测距的自定位功能。(DV-hop algorithm, wireless sensor non-ranging self-positioning function.)

获得一个二部图（两个部的顶点数要求一致）的最大匹配集，用于分配等问题的求解(get the maxinum_peipe )

OFDM system BER analysis in which both the transmitter and receiver are built.

相机标定棋盘格,方格大小为15mm，可以直接打印(Camera calibration checkerboard)

this mdl shows the non linear characteristics of the fuzzy controller

  最小费用最大流算法通用Matlab函数 基于Floyd最短路算法的Ford和Fulkerson迭加算法   基本思路：把各条弧上单位流量的费用看成某种长度,用Floyd求最短路的方法确定一条   自V1至Vn的最短路 再将这条最短路作为可扩充路,用求解最大流问题的方法将其上的流   量增至最大可能值 而这条最短路上的流量增加后,其上各条弧的单位流量的费用要重新   确定,如此多次迭代,最终得到最小费用最大流.( Minimum cost maximum flow algorithm for general Matlab functions based on the Floyd shortest path algorithm of Ford and Fulkerson superposition algorithm of the basic ideas: the cost of unit flow on the arc as a certain length of Floyd for the most short-circuit method to determine the one percent V1 through Vn are the most short-circuit then this short circuit as a scalable road, a method for solving the maximum flow problem on flow increased to the maximum possible value that the shortest way increased traffic, the cost of unit flow on each arc sure, so many iterations, the final minimum cost maximum flow.)