MATLAB-daptive-filtering

1、掌握MATLAB优化工具箱的基本用法，对不同算法进行初步分析、比较。 2、练习实际问题的非线性最小二乘拟合。(1.Understand the basic usage of Matlab optimization tool box. Analize and Compare different algorithms. 2. Practise nonliear minimum second order fitting using practical problems.)

matlab 工具箱 常用的函数和大量处理算法 matlab学习者必备材料(matlab toolbox commonly used functions and a large number of learners necessary materials processing algorithm matlab)

GM预测模型代码，可实现实时滚动预测，并带有输入输出界面(GM forecast model code, enabling real-time rolling forecasts, and with input and output interface)

PPP is used in frequency division duplex to solve Interference Issue. a Poisson point process is a particular kind of random process by which a set of isolated points are scattered about a line or a plane or a three-dimensional space or any of various other sorts of spaces. Often the term Poisson process is used to mean a Poisson point process in which the space in which isolated points are randomly scattered is a line, which in many applications represents time.

PSNR for image processing

说明：  将GPS得到的经纬度，大地坐标，通过高斯投影正算，得到平面直角坐标 文件大小不够，再增加了高斯投影的pdf文档(The longitude, latitude and geodetic coordinates obtained by GPS are corrected by Gauss projection, and the plane rectangular coordinates are obtained.)

说明：  高斯变换高斯变换高斯变换高斯变换高斯变换(Gaussian transformationGaussian transformationGaussian transformationGaussian transformationGaussian transformation)

关于DSCDMA的仿真，首先对信号调制，然后扩频，接收端解扩解调。包含单用户和多用户下的的误码率曲线。(On the DSCDMA simulation, firstly modulate signals , and then spread spectrum, the receiver de-spread demodulation. Including single-user and multi-user under the BER curve.)

“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。 (" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)

ieee spectrum 2013 september