DETECTION-USING-MATCHED-FILTER

建立一个MIMO系统，通过这个系统可以很好的了解到整个MIMO系统组成和结构(The establishment of a MIMO system, the adoption of the system can be very good that the whole composition and structure of MIMO systems)

线性滤波中的最陡下降法和LMS自适应算法的代码实现，两种算法进行比较，并画出了迭代轨迹曲线(Achieve linear filter method of steepest descent and the code of the LMS adaptive algorithm, two algorithms are compared, and draw the curve of the iterative trajectory)

一般支持向量机的回归和分类程序，均可以运行(General support vector machine regression and classification procedures can run)

apc control of a nmpc

this is all about ici method and ofdm system using main algo.....................

This example presents a Simulink model of an automotive wheel slip control loop as might be used in a rudimentary ABS system. Although idealized equations are used, the overall model demonstrates many of the essential features of a good Simulink model.

说明：  主要是生成集合[n]的所有k-子集MATLAB代码(Generating set [n] of all k-subset of MATLAB code)

Matlab的多项式,插值，样条函数 word 版本(MATLAB Polynomial Interpolation And Spline)

Image Compression using Artificial Neural Networks This code is developed in MATLAB 6.5 and can used in Windows platform. Program contain all necessary files. For training the network use Train.m and Codec.m compress images by trained network.

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