登录
首页 » matlab » LFM_xcorr

LFM_xcorr

于 2015-03-13 发布 文件大小:1KB
0 204
下载积分: 1 下载次数: 3

代码说明:

  介绍了一种快速信号相关算法,提高了相关计算效率,降采样频域相关(A fast signal correlation algorithm is introduced, to improve the relevant calculation efficiency, lower sampling frequency domain correlation)

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

发表评论

0 个回复

  • 11
    说明:  四阶统计求时延,拿来和大家共同研究,请指点(Fourth-order statistics for time delay, and everyone used to study, please instruct the)
    2008-03-14 21:37:27下载
    积分:1
  • Jacobi
    计算矩阵的解,是一种雅克比迭代,应用此程序可以很快的计算矩阵的解。(Computing solution matrix is a Jacobi iteration, the application of this procedure can quickly calculate the matrix solution.)
    2013-11-26 09:54:39下载
    积分:1
  • EMD-HHT
    采用希尔伯特黄变换对几组原始健康数据进行损伤检测等模拟(Hilbert Huang transform is used to simulate several groups of original health data.)
    2018-07-06 13:43:52下载
    积分:1
  • powerfactor
    this is the model of power factor correction by matlab program
    2010-06-12 19:01:12下载
    积分:1
  • Matlab_2_1
    matlab讲义 多的不说了,开放源代码!就是开放!(matlab handouts do not say more, open source! Is open!)
    2007-08-20 16:04:16下载
    积分:1
  • FIR
    用窗函数法设计FIR 数字滤波器 能产生矩型窗、升余弦窗、改进升余弦窗和二阶升余弦窗的窗函数子程序(Window function method using FIR digital filter designed to produce the window rectangle, raised cosine window, improving the second order raised cosine window and the window raised cosine window function subprogram)
    2009-01-01 17:16:32下载
    积分:1
  • MyKmeans
    实现聚类K均值算法: K均值算法:给定类的个数K,将n个对象分到K个类中去,使得类内对象之间的相似性最大,而类之间的相似性最小。 缺点:产生类的大小相差不会很大,对于脏数据很敏感。 改进的算法:k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用,这样的一个medoid就标识了这个类。步骤: 1,任意选取K个对象作为medoids(O1,O2,…Oi…Ok)。 以下是循环的: 2,将余下的对象分到各个类中去(根据与medoid最相近的原则); 3,对于每个类(Oi)中,顺序选取一个Or,计算用Or代替Oi后的消耗—E(Or)。选择E最小的那个Or来代替Oi。这样K个medoids就改变了,下面就再转到2。 4,这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感,但计算量显然要比K均值要大,一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))
    2005-07-26 01:32:58下载
    积分:1
  • Hopfbifurcation
    his is an hopf bufurcation program with using matlbab programming of some systems systems.
    2016-05-02 19:37:16下载
    积分:1
  • delphi3ceng
    说明:  三层源码构架,vipcard 客户机,服务器,中间层。(san ceng yuan ma gou jia)
    2009-07-31 18:04:38下载
    积分:1
  • GPIO-V2
    Core M3直接操作寄存器控制GPIO的用法。(Core M3 directly manipulate registers control the GPIO usage.)
    2013-11-28 09:54:33下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载