登录
首页 » matlab » 带有遗忘因子的递推最小二乘估计法

带有遗忘因子的递推最小二乘估计法

于 2018-06-18 发布 文件大小:24431KB
0 210
下载积分: 1 下载次数: 10

代码说明:

  带有遗忘因子的递推最小二乘估计法,可以用来辨识时变参数的程序(Recursive least squares estimation with forgetting factor can be used to identify time-varying parameters.)

文件列表:

canshubianshi.m, 1323 , 2018-06-04
[muchong.com]系统辨识与自适应控制MATLAB仿真.pdf, 30994345 , 2018-05-30

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

发表评论

0 个回复

  • zishiying
    说明:  matlab的各种自适应仿真分析。。自适应信息处理的算法、方案繁多,究其实质可归纳为遵循最小均方误差(Least Mean Square,LMS)准则及最小二乘(Least Square,LS)准则两大类,其他算法大多是这两种算法的演进。(matlab simulation analysis of various adaptive. . Adaptive information processing algorithms, a variety of plans, their essence can be summarized as follows the minimum mean square error (Least Mean Square, LMS) criterion and least squares (Least Square, LS) criteria for two categories, most of the two other algorithms kind of algorithm evolution.)
    2010-04-28 20:49:01下载
    积分:1
  • programy(1)
    Created OFDM coder and decoder for baseband signal transmission in 2K mode without error correction capabilities.
    2013-03-10 16:33:10下载
    积分:1
  • PAM_8
    用Simulink实现PAM调制,并显示星座图和眼图(PAM modulation and demodulation)
    2015-05-29 20:47:11下载
    积分:1
  • mp-QP mpc
    说明:  用mpt工具箱解决车辆转向控制问题,该程序中主要解决轨迹跟踪问题。(The problem of multi parameter planning is solved by using MPT toolbox on MATLAB platform. In this program, the problem of track tracking is mainly solved.)
    2021-04-10 11:28:59下载
    积分:1
  • Skindetect
    有关人脸检测和肤色检测的Matlab代码(Skindetect)
    2010-06-20 12:11:44下载
    积分:1
  • 2
    说明:   有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。 现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。 可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入: 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数,每组有一对数字。 输出: 可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
    2015-03-22 23:35:47下载
    积分:1
  • Vector-Quantization
    在natlab上进行矢量量化的仿真,包括生成码书,训练码字,生成码序列(Simulation vector quantization on natlab, including generating codebook, training codeword generated code sequence)
    2016-10-21 01:23:56下载
    积分:1
  • viterbi_bpsk
    BPSK 系统的卷积编码和viterbi译码过程(Convolutional coding for BPSK system and its viterbi decoding process)
    2014-12-07 19:31:23下载
    积分:1
  • OOP
    object-oriented programming
    2013-11-25 22:36:53下载
    积分:1
  • 88E1111
    Single-Port Gigabit Ethernet Transceiver
    2011-01-18 17:06:16下载
    积分:1
  • 696518资源总数
  • 105563会员总数
  • 11今日下载