登录
首页 » matlab » BEMD.m

BEMD.m

于 2009-12-19 发布 文件大小:2KB
0 119
下载积分: 1 下载次数: 165

代码说明:

  二维经验模式分解,速度较快,不错的代码,希望对学习HHT的朋友有用(Two-dimensional empirical mode decomposition, fast, good code)

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

发表评论


0 个回复

  • leinuofangcheng
    基于MATLAB的一种雷诺方程的数值解法,包括MATLAB程序(A MATLAB-based numerical solution of Reynolds equation, including the MATLAB program)
    2010-10-29 15:26:04下载
    积分:1
  • PIDfangzhen
    介绍了先进PID控制的各种算法的matlab仿真(Introduction of advanced PID control algorithms of matlab simulation)
    2008-05-14 09:41:43下载
    积分:1
  • regular
    LDPC仿真的一些列子,自己编写的,可能有一定错误,需要修改(Some Lie LDPC simulation, their preparation, may have some errors, you need to modify)
    2021-04-09 15:08:59下载
    积分:1
  • XIANGNONG
    香农—费诺编码的MATLAB实现,程序已在,可直接运行(Shannon- Fenno encoded MATLAB realization of the process had been in the direct operation)
    2009-01-02 18:49:19下载
    积分:1
  • stbc_matlab
    一个SM和STBC的代码,matlab编写,可是实现任意qam调制,可以计算误码率(A SM and STBC code, matlab prepared, but the realization of arbitrary QAM modulation, bit error rate can be calculated)
    2007-12-13 20:14:57下载
    积分:1
  • project3
    this som method in NeuralNetwork
    2009-05-29 15:10:00下载
    积分:1
  • 基于元胞自动机的微观交通流建模仿真
    基于元胞自动机的微观交通流建模仿真的结果matlab图形仿真(Graphic simulation of microscopic traffic flow modeling based on cellular automata simulation matlab)
    2013-03-30 16:38:04下载
    积分:1
  • 10
    Converting an image into blocks of 8 x 8 and apply DCT on any one of the blocks
    2014-01-22 13:28:41下载
    积分:1
  • Recursive_integer_division
    递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
    2014-02-06 14:21:38下载
    积分:1
  • ex3-network
    代码提供了一个矩阵,其中存有点到点的距离,根据输入的起点与终点计算出最短路径(Code provides a matrix into which the distance from point to point, the start and end points of the input calculate the shortest path)
    2013-11-23 02:19:50下载
    积分:1
  • 696518资源总数
  • 104817会员总数
  • 9今日下载