-
Done
说明： 用MATLAB进行ASK、FSK、PSK的编码和解码的仿真程序，并对其误码率进行分析(Using MATLAB for ASK, FSK, PSK encoding and decoding of the simulation program, and analyze its BER)
- 2010-04-23 22:40:57下载
- 积分：1
-
strlen
function strlen and strcpy and strcut in c++ and c for use
- 2014-12-21 00:23:23下载
- 积分：1
-
alpha_Jerk
针对模型中人为设定参数值的不合理性，对机动时间常数的倒数进行建模，提出新的模型，并给出相应的α-Jerk滤波算法。该模型在估计目标状态的同时，能够实时估计参数α的值。仿真结果表明α-Jerk模型比Jerk模型收敛速度更快，状态估计更精确。并与jerk算法进行了比较。(Artificially set for the model parameter values of the irrational nature of the reciprocal of the motor time constant modeling, and propose new models and the corresponding alpha-on Jerk filtering algorithm. The model to estimate the target state at the same time, real-time estimate of the value of the parameter α. The simulation results show that alpha-on Jerk model faster convergence than the Jerk model, state estimation more accurate. And jerk algorithm.)
- 2012-06-19 16:04:06下载
- 积分：1
-
MATLAB_Simulink_tutorial
this file is about matlab/simulink
- 2011-09-03 06:32:45下载
- 积分：1
-
hart
HART协议文本，很难找到的，对开发HART协议相关特别有用。(HART text of the agreement, it is difficult to find, on the development of HART protocol related particularly useful.)
- 2020-11-25 15:29:32下载
- 积分：1
-
FingerPrints
Peter Kovesi 编制的Matlab指纹图像图像处理源代码(Peter Kovesi fingerprint image produced by image processing Matlab source code)
- 2009-05-06 11:49:35下载
- 积分：1
-
rwg4
Antenna and EM Modeling with MATLAB
- 2011-10-07 06:08:36下载
- 积分：1
-
4Reconstruction-Filter-Bank
4Almost Perfect Reconstruction Filter Bank for Non-redundant hosseini_ complex wavelet_06_5045[1]
- 2014-11-19 15:03:05下载
- 积分：1
-
LS3P
线性化法仿真三个参考节点定位一个定位节点，随机噪声均方差随机分布在[4,10]，多径效应，权重分布在[0.85，1]。(Linearization method simulation of three reference nodes positioning a positioning node, the variance of random noise are randomly distributed in [4,10], multi-path effects, the weight distribution in [0.85,1].)
- 2011-11-23 10:17:02下载
- 积分：1
-
SIMULATED-ANNEALING-
这是一个关于商人visit许多城市，怎样走法才能使距离最短的例子，采样的了退火算法的经典案例(Traveling Salesman Problem (TSP) has been an interesting problem for a l
me in classical optimization techniques which are based on linear and nonlin
ogramming. TSP can be described as follows: Given a numberof cities to v
d their distances from all other cities know, an optimal travel route has to
und so that each city is visited one and only once with the least possible dista
aveled. This is a simple problem with handful of cities but becomes complica
the number increases.)
- 2013-12-15 03:26:30下载
- 积分：1
