登录
首页 » matlab » Kalman-matlab

Kalman-matlab

于 2012-02-02 发布 文件大小:13KB
0 252
下载积分: 1 下载次数: 6

代码说明:

  kalman滤波算法应用matlab语言来实现。(kalman filter matlab )

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

发表评论

0 个回复

  • contrastImprove5
    Contrast improuvement using INT operators Ion grayscale image
    2013-01-28 00:40:31下载
    积分:1
  • mad
    Matlab code for speech processing
    2015-03-24 20:26:20下载
    积分:1
  • zhaixiangguan
    导航信号体制多径抗干扰中,窄相关技术的Matlab仿真源代码(Matlab simulation source code of the the navigation multipath interference signal system, narrow-related technologies)
    2013-05-15 10:13:17下载
    积分:1
  • ball
    小球在圆环上做圆周运动,可以滑动调节小球运动速度.(Small ball in the circle to do the circular motion, you can adjust the ball sliding velocity.)
    2008-06-06 22:40:05下载
    积分:1
  • Matlab
    这是一本非常适合初学者学习matlab的书,讲述很详细,易懂,希望对大家有帮助。(This is a great book for beginners to learn matlab, tells a very detailed, easy to understand, we want to help.)
    2010-05-27 22:17:43下载
    积分:1
  • matlab-power-system-simulation
    介绍了matlab电力系统的仿真与分析的基本知识(Basic knowledge of matlab power system simulation and analysis)
    2013-03-19 12:55:49下载
    积分:1
  • Elec.-Billll
    project on electric bill details that store all the detail of bill.
    2015-03-30 13:07:01下载
    积分:1
  • ed_5
    energy detection algorithm.
    2012-01-25 15:29:20下载
    积分: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
  • rbmcda_1_0
    rao-blackwellised data association partical filters
    2010-07-21 23:05:46下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载