TE

Realtime Visualisation of data converted by AD7787 chip and transmitted through pic microcontroller

小波分析，基于DWT的故障信号特征提取，可以画出条形图，多层分解(Wavelet analysis, DWT-based feature extraction of fault signal can draw bar charts, multi-decomposition)

四阶Runge-Kutta法解一阶常微分方程Matlab代码(Fourth-order Runge-Kutta method for solving a first-order ordinary differential equations Matlab code)

一级倒立摆的模糊控制，用融合函数的思想，基于最优控制。通过simulink仿真。(An inverted pendulum fuzzy control, with the idea of integration of functions, based on the optimal control. Through the simulink simulation.)

I am uploading a file of Direct Sequence and Frequency Hopping Spread Spectrum Systems, understanding differences between both schemes. Plz accept it. Thanks and Regards, salman

四元数与线性卡尔曼滤波求解INS/GPS组合导航姿态(Four element and linear Calman filtering for INS/GPS integrated navigation attitude)

包含非线性卫星转发器的FDM系统的仿真 仿真一个从卫星到区域数据中心的下行链路（由一组6个载波构成），评估热噪声，交调（IM）失真、由滤波器造成的码间干扰（ISI）以及邻频干扰对下行链路性能的影响。 (Contains the non-linear satellite transponder FDM system simulation simulation of a regional data centers from the satellite to the downlink (from a group of six carrier composition) to assess the thermal noise, intermodulation (IM) distortion, caused by the filter inter-symbol interference (ISI) and adjacent channel interference on the downlink performance.)

matlab模糊控制FuzzySetsandFuzzyInformationGranulationTheory(matlab fuzzy controlFuzzySetsandFuzzyInformationGranulationTheory)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

为sinudoidal模型的AIC阶估计.AIC信息准则即Akaike information criterion，是衡量统计模型拟合优良性的一种标准，又由于它为日本统计学家赤池弘次创立和发展的，因此又称赤池信息量准则。它建立在熵的概念基础上，可以权衡所估计模型的复杂度和此模型拟合数据的优良性。 在一般的情况下，AIC可以表示为： AIC=2k-2ln(L) 其中：k是参数的数量，L是似然函数。 假设条件是模型的误差服从独立正态分布。 让n为观察数，RSS为剩余平方和，那么AIC变为： AIC=2k+nln(RSS/n) 增加自由参数的数目提高了拟合的优良性，AIC鼓励数据拟合的优良性但是尽量避免出现过度拟合(Overfitting)的情况。所以优先考虑的模型应是AIC值最小的那一个。赤池信息准则的方法是寻找可以最好地解释数据但包含最少自由参数的模型。(AIC order estimation for sinudoidal model)