yi

patton程序中关于超越概率的计算及其图像(patton`s code for exceedance correlation)

matlab环境下用simulink模拟BPSK扩频解扩过程(matlab environment simulation BPSK spreading despreading process using simulink)

%(第一步加载原始数据并绘图)m文件保存代码;而mat文件保存工作区里面已经加载或计算好的数据 %当前文件夹显示的路径一定要是保存数据和保存代码的文件夹 %“relt”是包含分解结果的矩阵，第一列是原始输入（“gsta（：，2）”），最后一列是趋势。 中间是IMF频率从高到低。 %应该注意的是，由于在eemd.m中，IMF的总数m被指定为log2（N）-1，在某些情况解的线条进行了合并 %因此会比实际分解得到的减少，但在计算周期和表现显著性的时候要将每个模态的周期和显著性计算在内。((The first step is to load the original data and draw) m file saves the code; the mat file saves the data already loaded or calculated in the workspace %% the current folder displays a path that must store data and save the code folder. %"relt" is the matrix that contains the decomposition result, the first column is the original input ("gsta (:, 2)"), and the last column is the trend. The middle is the IMF frequency from high to low. It should be noted that since the total number m of IMFs in eemd. m is specified as log2 (N) - 1, the lines of the solution are merged in some cases % will therefore be less than the actual decomposition, but the period and salience of each mode will be taken into account when calculating the period and performance saliency.)

说明：  永磁同步电机无位置传感器matlab仿真模型文件，很详细。(PMSM sensorless matlab simulation model file, very detailed.)

说明：  快速迭代收缩阈值算法，FISTA用一种更为聪明的办法选择序列{xk}，使得其基于梯度下降思想的迭代过程更加快速地趋近问题函数F(x)的最小值。FISTA的缺点是：Lipschitz常数L(f)不一定可知或者可计算。(Fast iterative contraction threshold algorithm, FISTA uses a more clever method to select the sequence{xk}, making its iterative process based on the gradient descent idea more quickly approach the minimum value of the problem function F(X). The disadvantage of FISTA is that the Lipschitz constant L(f) is not necessarily known or computable.)

该代码是lte数据传输中的加扰技术的源代码(The code is lte data scrambling technology in source code)

随机微分方程工具，matlab程序....(sde toolbox)

128 image in matlab code

格基约减下的zf(迫零检测)算法，适用于多输入多输出系统(lattice reduction aided ZF algorithms)

说明：  用于最小二乘法进行曲线拟合的MATLAB源代码(Curve fitting)