登录
首页 » matlab » ADRC_NLSEF2

ADRC_NLSEF2

于 2021-04-04 发布 文件大小:17KB
0 129
下载积分: 1 下载次数: 155

代码说明:

  用simulink搭建的自抗扰控制器的非线性反馈模型,与之前传的那个略有不同(Simulink build the ADRC controller of nonlinear feedback model is slightly different, and that before the transfer)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • kepler
    说明:  matlab求解kepler参数数学模型建立→MATLAB数值分析方法求解的(use matlab kepler)
    2011-03-28 19:58:14下载
    积分:1
  • isentropic_vortex
    matlab环境下编写的求解等熵涡问题,属于CFD入门级代码(matlab environment prepared isentropic vortex problem solving, is the entry-level CFD code)
    2020-12-08 19:29:20下载
    积分:1
  • apriori
    matlab实现推荐系统Apriori算法(recommendation system)
    2015-04-07 09:48:17下载
    积分:1
  • sinx1
    采用rbf神经网络逼近sinx函数简单实例(use Rbf neural network to approximate a simple instance of sinx function)
    2018-10-05 14:04:14下载
    积分:1
  • quanzixiangguanxishu
    微弱信号的全自相关系数提取与样本特征向量。(Weak signal of the whole auto-correlation coefficient with the sample feature vector extraction.)
    2008-04-12 13:43:19下载
    积分:1
  • Sviterbi
    由于硬判决在判决过程中将接收直接判决为[1 0],而损失了相应的近似信息,导致了接收信息在某种意义上的浪费。软判决将接收电平量化,尽可能保存相应的信息,故可以提高译码性能。(soft descision decoding)
    2012-06-11 16:34:46下载
    积分:1
  • calculate-FFT
    基于FFT平面相控阵天线方向图快速计算 (Figure quickly calculate FFT-based planar phased array antenna direction)
    2013-12-04 12:31:56下载
    积分:1
  • Harris-Detector-master
    MY AREA OF WORKING IS ON IMAGE WATERMARKING.. I WANT SOME HELP REGARDING THAT..
    2014-02-11 21:00:15下载
    积分:1
  • ML_cp
    利用循环前缀的最大似然同步算法,程序正确并实现,欢迎大家前来下载。(The use of cyclic prefix of the maximum likelihood synchronization algorithm, the program correctly and to achieve, we are happy to come to download.)
    2010-03-08 21:04:59下载
    积分:1
  • Floyd
    Floyd算法的matlab实现。对输入的邻接距离矩阵计算图中任意两点间的最短距离矩阵和路由矩阵,且能查询任意两点间的最短距离和路由。并根据结果自动绘制出了最短路径图。 程序中使用了前向路由和回溯路由两种方法,并对于无向图进一步减小算法复杂度。(Matlab implementation of the Floyd algorithm. Adjacent input distance matrix between any two points in calculating the figure, the shortest distance matrix and routing matrix, and can query the shortest distance between any two points and routing. Automatically based on the results map out the shortest path graph. Used in the program prior to routing and backward routing are two methods, and undirected graph further reduce the algorithm complexity.)
    2012-07-23 10:28:52下载
    积分:1
  • 696518资源总数
  • 104349会员总数
  • 32今日下载