ATC_Demo1

两种算法（LMS和RLS）实现CDMA系统盲多用户检测的仿真。结论验证了在加性高斯白招生信道下、同步DS-CDMA系统中接收机应用这两种盲多用户检测算法抑制多址干扰（MAI: multiple access interference）和码间串扰（ISI: inter symbol interference）的能力,仿真实验与理论推导相吻合。实验与理论都表明,RLS性能好于LMS，而LMS计算量明显小于RLS。(This paper discusses two algorithms (LMS and RLS) to achieve blind multiuser detection CDMA system simulation. Conclusion is verified in the Additive White Gaussian noise channel, the synchronous DS-CDMA system receiver applications both blind multiuser detection algorithm to suppress Multiple Access Interference（MAI）and Inter Symbol Interference (ISI) the ability of simulation is consistent with the theoretical. Both experiment and theory show that, RLS’s Performance is better than LMS, and the LMS ‘s computation was significantly less than RLS. )

用matlab实现的一种求信道容量的改进方法，用实例验证通过(using Matlab achieve a channel capacity for the improvement of methods and is validated through)

logistic差分方程倍周期和混沌分支图。(logistic difference equation fold periodic and chaotic branching diagram.)

content based search of images uisng matlab.

坐结构可靠性的前程序，可以直接调用sigmund的99行，实现结构可靠性设计。(Reliability of the procedure before the ride, you can directly call sigmund 99 lines, to achieve structural reliability design.)

说明：  飞行模拟转台伺服系统仿真 S为信号变量 1为正弦 2为阶跃 3为方波(flight simulation turntable servo system simulation S signal to a variable sinusoidal Step 2 for 3 for the square wave)

关于导航定位中的卡尔曼滤波程序。X1，X2分别代表经过转换以后的位置X,Y轴的坐标。V1，V2为其相对应的速度。卡尔曼滤波可以使定位数据更加平滑。(Calman filtering program in navigation and positioning. X1, X2, respectively, after conversion to the position of the X, Y axis coordinates. V2, V1 for its relative speed. Calman filter can make the positioning data more smooth.)

说明：  能够实现模型预测功率控制，提高直接功率控制的稳态以及动态性能(It can realize model predictive power control and improve the steady-state and dynamic performance of direct power control)

Three phase space vector pulse width modulation using generalised multiphase space vector aproach

解决最小费用最大流问题，一般有两条途径。一条途径是先用最大流算法算出最大流，然后根据边费用，检查是否有可能在流量平衡的前提下通过调整边流量，使总费用得以减少？只要有这个可能，就进行这样的调整。调整后，得到一个新的最大流。(Minimum cost maximum flow problem to solve, there are generally two ways. One way is to use a maximum flow algorithm to calculate the maximum flow, then the cost side, check whether it is possible under the premise of the flow balance by adjusting the edge flow, so that the total cost can be reduced? As long as this possible, for such adjustments. Adjusted to obtain a new maximum flow.)