登录
首页 » matlab » Pack Kurtogram程序

Pack Kurtogram程序

于 2020-10-19 发布
0 163
下载积分: 1 下载次数: 15

代码说明:

说明:  快速谱峭度提取信号频域信息,确定信号频带特征,效果很好(Fast spectral kurtosis is used to extract signal frequency information and determine signal frequency characteristics, which is very effective.)

文件列表:

Pack Kurtogram程序, 0 , 2018-05-14
Pack Kurtogram程序\0.2H.mat, 583187 , 2016-09-25
Pack Kurtogram程序\105.mat, 2910768 , 2017-07-23
Pack Kurtogram程序\ball.txt, 2514762 , 2017-07-04
Pack Kurtogram程序\binary.m, 383 , 2016-09-25
Pack Kurtogram程序\DBFB.m, 793 , 2016-09-25
Pack Kurtogram程序\demo_Fast_Kurtogram.m, 1325 , 2017-07-23
Pack Kurtogram程序\Fast_Kurtogram.m, 6036 , 2016-09-25
Pack Kurtogram程序\Find_stft_kurt.m, 2671 , 2016-09-25
Pack Kurtogram程序\Find_wav_kurt.asv, 2243 , 2016-09-25
Pack Kurtogram程序\Find_wav_kurt.m, 2256 , 2016-09-25
Pack Kurtogram程序\H-0.3.mat, 76997 , 2016-09-25
Pack Kurtogram程序\HH.mat, 585940 , 2016-09-25
Pack Kurtogram程序\HQIU.mat, 256749 , 2016-09-25
Pack Kurtogram程序\hua_baoluo.m, 1689 , 2016-09-25
Pack Kurtogram程序\hua_fft1.m, 713 , 2016-09-25
Pack Kurtogram程序\hua_hilbert1.m, 188 , 2016-09-25
Pack Kurtogram程序\inner.txt, 2526985 , 2017-07-04
Pack Kurtogram程序\inner_5k_2400r_10s.txt, 3164088 , 2017-08-03
Pack Kurtogram程序\Kf_fft.m, 999 , 2016-09-25
Pack Kurtogram程序\Kf_W.m, 2014 , 2016-09-25
Pack Kurtogram程序\kurt.m, 696 , 2016-09-25
Pack Kurtogram程序\K_wpQ.m, 1354 , 2016-09-25
Pack Kurtogram程序\K_wpQ_filt.m, 1480 , 2016-09-25
Pack Kurtogram程序\K_wpQ_filt_local.m, 925 , 2016-09-25
Pack Kurtogram程序\K_wpQ_local.m, 2430 , 2016-09-25
Pack Kurtogram程序\lmd.mat, 584930 , 2016-09-25
Pack Kurtogram程序\matlab.mat, 587447 , 2016-09-25
Pack Kurtogram程序\matlab1.mat, 442670 , 2016-09-25
Pack Kurtogram程序\matlab111.mat, 586343 , 2016-09-25
Pack Kurtogram程序\matlabHQIU.mat, 256749 , 2016-09-25
Pack Kurtogram程序\max_IJ.m, 481 , 2016-09-25
Pack Kurtogram程序\n5k_2400r_10s.txt, 3944672 , 2017-08-03
Pack Kurtogram程序\normal.txt, 2624312 , 2017-07-26
Pack Kurtogram程序\out_2400.txt, 2582200 , 2017-07-03
Pack Kurtogram程序\out_5k_2400r_10s.txt, 3119666 , 2017-08-03
Pack Kurtogram程序\raylinv.m, 894 , 2016-09-25
Pack Kurtogram程序\roll_5k_2100r_10s.txt, 3177941 , 2017-08-03
Pack Kurtogram程序\TBFB.m, 535 , 2016-09-25
Pack Kurtogram程序\VOIE1.MAT, 874144 , 2016-09-25

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

发表评论

0 个回复

  • 2-GEANT4-simulation-algorithm
    Geant4典型模拟算法及基本Run,event,track,step,基本概念( Geant4)
    2017-04-01 16:56:54下载
    积分:1
  • 吴小华---接口说明文档
    接口规范,前端主要js,后端java、php、python等语言(nterface specification, front-end main js, back-end java, php, Python and other languages)
    2020-06-17 15:20:12下载
    积分:1
  • bownarrow
    一个外国人编写的labview的小游戏,供大家娱乐一下,可惜看不仅源代码(Labview prepared by a foreigner of small games, entertainment for all to look at, but sadly not only the source code)
    2009-10-04 00:03:31下载
    积分:1
  • 111
    描述了车辆运行稳定性的计算及影响因素,具有很好的参考意义(The calculation and influence factors of the vehicle running stability are described. It is of great reference significance.)
    2018-03-14 20:43:55下载
    积分:1
  • c3
    说明:  c-sharp基本操作及基本研究!删除,添加,插入!(c-sharp!)
    2009-10-28 19:25:23下载
    积分:1
  • ABL_simulation
    说明:  Fluent大气边界层入口湍流生成UDF(turbulence inlet UDF for ABL)
    2020-12-12 23:39:15下载
    积分:1
  • v4-1-4
    Time and Frequency Domain Analysis HRV
    2021-04-06 14:39:03下载
    积分:1
  • gyxyx
    搭建OFDM通信系统的框架,大学数值分析算法,相参脉冲串复调制信号。( Build a framework OFDM communication system, University of numerical analysis algorithms, Complex modulation coherent pulse train signal.)
    2017-05-01 22:18:33下载
    积分:1
  • 5
    1、 创建图类,存储结构使用邻接矩阵。 2、 输入图的节点数n(不超过10个)、边数m,节点分别用1-n代表。 3、 采用“起始节点,终止节点,权值”输入图的m条边,创建图。 4、 输出从节点1开始的BFS遍历,在遍历过程中,如有多个可以选择的节点,则优先选择编号较小的节点。 5、 输出从节点1开始的DFS遍历,在遍历过程中,如有多个可以选择的节点,则优先选择编号较小的节点。 6、 输出从第1节点到第n节点最短路径的长度,如果没有路经,输出0。(1. Create graph class and use adjacency matrix in storage structure. 2. The number of nodes n (no more than 10) and edge m in the input graph are represented by 1-n, respectively. 3. Create a graph by using the m-edges of the input graph of "Starting Node, Terminating Node, Weight Value". 4. Output BFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 5. Output DFS traversal starting from node 1. In the traversal process, if there are multiple nodes to choose, the node with smaller number will be preferred. 6. Output the length of the shortest path from the first node to the n node. If there is no path, output 0.)
    2019-02-19 14:49:05下载
    积分:1
  • imageprocessingC
    这是我珍藏的图像处理入门C源码分析,给大家共享了!(This is my collection of the Image Processing entry C source code analysis, to share!)
    2006-08-03 09:50:44下载
    积分:1
  • 696518资源总数
  • 105958会员总数
  • 18今日下载