cyclecode

Filtro LC para PWM jhagyusagyuegae

说明：  自己编写的卡尔曼滤波算法算例，实现四阶AR模型的最优权值估计。(Kalman filter algorithm, for optimal weight estimating of fourth-order AR model.)

This program reconstruct the mean temperature profile with the angle in the troposphere that is modeled with the program itself and needs the following functions: ariachiara,ariachiara2,nebbia,nebbia2,cirro,cirro2,pressione,nuvola,nuvola2,layer,layer2

文件中有两个97提升小波程序，可以直接在matlab中运行，已经试过(File has two 97 lifting wavelet procedures can be directly run in matlab, have tried)

结构体在matlab中的应用，matlab教程，word格式(structure used in matlab)

This m files and Gui files are for solve the problem about Find specific position in 3D space. by using 3d circles you can axis in 3d spaces except one situation explaned as not selected axis x,y,z if you want to know more about seek the position in 3D spaces than depress the zip file and operate m file named Robot_report1 and Robot_report1.fig

MYW - ARMA 算法的MATLAB代码, 是频谱分析(通常是在高级DSP这门课中会用到的)的常用算法(MYW- ARMA algorithm MATLAB code, Analysis of the spectrum (usually at the senior DSP This class will be used) to the commonly used algorithm)

matlab中三样条插值编程，在matlab应用是可直接使用，方便快捷。(Three spline interpolation matlab programming matlab application is in direct use, convenient and quick.)

三相无源逆变的仿真，采用双闭环控制，PT调节器。(Passive three-phase inverter simulation, using the double closed loop control, PI regulator )

“基于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.)