登录
首页 » matlab » IMM

IMM

于 2010-01-03 发布 文件大小:2KB
0 181
下载积分: 1 下载次数: 275

代码说明:

  交互式多模型算法卡尔曼滤波仿真代码,程序中采用了两个模型(Interacting multiple model Kalman filter algorithm simulation code, the program uses two models)

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

发表评论

0 个回复

  • MATLAB
    很全的讲matlab的资料,对于初学matlab的人很有帮助,总共220页,也可以作为编程的参考资料。(Detailed interpretation of the matlab sourse code,Just learning to matlab for people, as well as the learning matlab reference.Hope to be helpful to you.The content page 220.)
    2012-04-25 21:28:01下载
    积分:1
  • PMSM-Drive-Simulation-Files
    drive of pmsm with vector control
    2014-11-21 18:37:52下载
    积分:1
  • R32P_T
    利用Peng-Robinson方程计算纯质R32p—T相图(Peng-Robinson equation using pure R32p-T phase diagram)
    2010-01-17 16:07:26下载
    积分:1
  • IMP
    impedence matrix formation
    2014-08-07 13:34:06下载
    积分:1
  • BasicSnake_version2d
    Snake模型和GVF Snake模型的程序,包括2D和3D实现。(Snake model and GVF Snake model procedures, including 2D and 3D.)
    2011-01-26 15:46:12下载
    积分:1
  • MYBCH
    Generat the Code Word
    2012-04-07 05:17:04下载
    积分:1
  • Color_Image_Enhancement_by_a_Forward_an
    color image enhancements
    2014-11-27 18:49:03下载
    积分:1
  • QAMmatlabfile
    QAM的蒙特卡洛仿真QAM的蒙特卡洛仿真QAM的蒙特卡洛仿真.(QAM的蒙特卡洛仿真.)
    2009-04-08 22:49:53下载
    积分:1
  • copap
    Matlab demo code for the cyclic order preserving assignment problem with application to shape matching(Matlab demo code for the cyclic order prese rving assignment problem with application to s CPR matching)
    2007-01-25 07:49:17下载
    积分:1
  • combine---two-binary-trees-
    This is a small program to create indexs for two binary trees and combine them to a new 003 * index tree and output the new tree,the second tree only has the left child tree then 004 * if the first tree has no left child tree,insert the second tree into the first tree as 005 * its left child and if the first tree has the left child tree,then insert the first tree 006 * into the second tree as its left child. (This is a small program to create indexs for two binary trees and combine them to a new 003* index tree and output the new tree, the second tree only has the left child tree then 004* if the first tree has no left child tree, insert the second tree into the first tree as 005* its left child and if the first tree has the left child tree, then insert the first tree 006* into the second tree as its left child.)
    2012-06-11 16:16:55下载
    积分:1
  • 696518资源总数
  • 106148会员总数
  • 10今日下载