登录
首页 » matlab » timefre

timefre

于 2014-12-03 发布 文件大小:216KB
0 177
下载积分: 1 下载次数: 2

代码说明:

  时频分析,窗宽对信号恢复的影响 以及差值分析(Time-frequency analysis, the impact of the window width and the difference signal recovery analysis)

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

发表评论

0 个回复

  • matlab-chinese-help
    matlab中文帮助,现在Matlab的下载资源较少,中文版的帮助更少,有了中文版,可以更好的学习Matlab(matlab Chinese help, and now Matlab download with fewer resources, the Chinese version of the help less, with the Chinese version, you can better learning Matlab)
    2008-04-24 09:30:59下载
    积分:1
  • plaincontrolnetcomputation
    平面控制网平差程序,使用平面控制网测量数据进行最小二乘法平差拟合,得到平面控制网结果(use of TSL and surveying datas to get horizontal control network result)
    2011-01-01 15:51:17下载
    积分:1
  • GuoTao
    说明:  用MATLAB编写的粒子群基本算法-PSO算法来求无约束函数的极值问题,得出比较好的结果(MATLAB prepared using the basic algorithm PSO-PSO algorithm to seek non-binding function of the extremal problem, arrive at some more good results)
    2008-09-01 19:18:39下载
    积分:1
  • lab02
    在MATLAB实现的用C实现的KNN算法,输入训练数据文件,和test文件,进行预测分类,并且可以与真实情况比较测试预测正确百分比(Implemented in MATLAB KNN algorithm implemented in C, the input training data file, and test files, to predict the classification and testing with the real situation is more correct percentage of predicted)
    2011-06-16 11:20:09下载
    积分:1
  • SC
    说明:  Diversity Techniques over Fading Channels Selection Combining
    2014-10-08 03:50:40下载
    积分:1
  • Genmagicos
    This a code in matlab. Calculus the magic square of a size especific. This code is make with algoritms genetics.
    2009-07-11 03:45:25下载
    积分:1
  • work3
    说明:  matlab中不同序列的分类,利用内积不同来分类,附注释(matlab different sequence classification, the use of inner product different to the classification of annotated)
    2008-09-19 22:28:04下载
    积分:1
  • DCT_Qianru
    说明:  这是关于DCT域的嵌入算法 用matlab实现的 它可以获得很高的不可感知性。(on DCT algorithm embedded with Matlab it can achieve the high Imperceptible sex.)
    2006-03-22 12:58:50下载
    积分:1
  • mo_phong
    simulation matlab and simulink
    2015-01-14 21:27:44下载
    积分:1
  • 最大二分配法
    如果G的边集E(G)中有个子集M,满足M中的任何两条边 都不邻接,则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配,最大匹配所包含的边数称为最大匹配数。当 G是二分图时,问题就比较特殊了,这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
    2021-01-20 10:38:41下载
    积分:1
  • 696518资源总数
  • 106208会员总数
  • 21今日下载