zhengxuan1

DFT 计算 实验步骤： 主界面下进入实验九的“DFT计算”的子实验。 输入取样点数，即有限长序列 x(n) 的长度。 输入信号表达式，或直接输入离散序列。 鼠标单击确定按钮，显示原序列及 DFT 系数的幅度、相位。(DFT calculation of the experimental steps: the main interface into the experimental Kau " DFT calculation of" sub-experiment. Enter the sampling points, that is, finite sequences x (n) length. Expression of the input signal, or directly onto a discrete sequence. Mouse click OK button to display the original sequence and the magnitude of DFT coefficients, phase.)

APF svpwm方式的matla simulink模型(Matla simulink model APF svpwm way)

The Hurst parameter H characterizes the degree of long-range dependence (and asymptotic selfsimilarity) in stationary time series. Many methods have been developed for the estimation of H data. In practice, however, the classical estimation techniques can be severely affected by nonstationary artifacts in the time series.

采用MATLAB调用cplex求解含有风电场的电力系统经济调度，并且考虑了场景分析的方法(Call cplex solved using MATLAB economic dispatch of power system containing wind farms, and to consider the method of scene analysis)

说明：  测量语音增强或者语音分离的效果，包含pesq，stoi以及分段信噪比等(Measure the effects of speech enhancement or speech separation, including PESQ, STOI, and segmented signal-to-noise ratio)

FDM卫星通信仿真程序及一些辅助函数，共有六条上行链路(FDM satellite communication simulation program and some auxiliary functions, a total of six uplink)

A Low-Computational Approach on Gaze Estimation With Eye Touch System

本算法是最新FFT用于稀疏分解的快速算法，其中包括了对FFTinMP的计算复杂度的改进。(The FFT algorithm is the latest fast algorithm for sparse decomposition, including the complex calculation of FFTinMP Complex degree of improvement.)

ICA+pcnn代码，用于噪声人脸识别，有合适的接口就能运行(failed to translate)

说明：   用最速下降法求最优化解 输入：f为函数名 grad为梯度函数 x0为解的初值 TolX,TolFun分别为变量和函数的误差阈值 dist0为初始步长 MaxIter为最大迭代次数 输出: xo为取最小值的点 fo为最小的函数值 f0 = f(x(0))( Steepest Descent Method with Optimum Solution input: f as a function name grad is gradient function x0 for the solution of the initial TolX, TolFun variables and functions were error threshold dist0 as the initial step MaxIter maximum Diego passage number Output: xo to take the minimum point of fo is the smallest function value f0 = f (x (0)))