登录
首页 » matlab » clutter

clutter

于 2021-02-26 发布 文件大小:4KB
0 304
下载积分: 1 下载次数: 105

代码说明:

  模拟杂波的生成,包括高斯杂波,韦布尔杂波和K分布杂波,对数正态分布杂波(clutter simulation)

文件列表:

clutter_generate.m,2232,2014-05-29
Gaussion.m,1771,2014-05-29
glp.m,295,2014-05-19
LN.m,1501,2014-05-29
nonline_eq_sirp.m,757,2014-05-17
weibull.m,1683,2014-05-29

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

发表评论

0 个回复

  • pattern
    this code is used for processing all the directory
    2009-06-03 20:13:12下载
    积分:1
  • cabquan
    庞加莱模拟分岔图的matlab代码,仅供参考(poincare chaos)
    2021-04-12 13:18:57下载
    积分:1
  • projectcode4x4t2
    signal detection using qrdm for 4x4 system
    2010-10-19 16:53:09下载
    积分:1
  • GA
    说明:  这是一个关于遗传算法的程序,本人师兄编写的,绝对能够运行~(This is a process of genetic algorithm, written in my brother definitely be able to run ~)
    2011-03-19 19:47:58下载
    积分:1
  • histogram
    在matlab中实现直方图均衡化操作及直方图匹配操作,自编代码实现运算(Histogram equalization and histogram match.)
    2013-09-21 08:55:45下载
    积分:1
  • Car
    四轮转向汽车的MATLAB实现,3种实现方式。输入量为前后轮的旋转角度,输出量为汽车侧偏角和横摆角速度。6.5版本编写。(MATLAB realization of four-wheel steering vehicle, 3 implementation. Enter the amount of rotation of front and rear wheels, the output volume for the automotive side slip angle and yaw rate. 6.5 preparation.)
    2011-01-08 21:53:45下载
    积分:1
  • 新建压缩文件
    斐波那契算法,及代码,求最优解,提高算法速度及精度(Fibonacci algorithm and code to find the optimal solution, improve the speed and accuracy of solution)
    2020-06-15 22:30:01下载
    积分:1
  • Modi_Gram_S
    modified Gram-Schmidt (reduced QR factorization). A is a m-by-n matrix(m>=n)
    2021-02-22 10:59:41下载
    积分:1
  • YTY_GA_Final
    To find the largest fitness value and its location 寻找最大适应性及相应的位置! Population N=50;crossover bits=n/2 (half of bits of an individual) with random locations,mutation bits = 4 种群数 N=50,交换位数= n/2, 即个体位数的一半,且位置随机; 变异位数统一取为4; Nc=20,28,36,44,individuals for crossover(交换的个数)。 Nm=1,5,10,15, individuals for mutation(变异的个数)。 (To find the largest fitness value and its location to find the location of the maximum adaptability and the corresponding! Population N = 50 crossover bits = n/2 (half of bits of an individual) with random locations, mutation bits = 4 population size N = 50, exchange digits = n/2, ie half of the median individual, and random position variation is taken as unity median 4 Nc = 20,28,36,44, individuals for crossover (exchange number). Nm = 1,5,10,15, individuals for mutation (the number of variations.))
    2010-12-27 21:23:27下载
    积分:1
  • qinghuaxuebang
    一种对连续野值不敏感的鲁棒卡尔曼滤波器, 对清华学报上的一篇文章的仿真,能有效剔除连续型野值 (A field value is not sensitive to the continuous robust Kalman filter, for an article on the Tsinghua University policy, can effectively eliminate the value of continuous field)
    2011-05-18 20:02:36下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载