登录
首页 » matlab » Matlab-wavelet-noise-removal

Matlab-wavelet-noise-removal

于 2014-09-23 发布 文件大小:2KB
0 70
下载积分: 1 下载次数: 10

代码说明:

  小波去噪程序,根据信号的频域特征对信号进行小波分解,然后去噪(program for artifact removal, this function is obtained based on the frequency feature of signal.)

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

发表评论

0 个回复

  • simple
    this script simulate the cooperative communication in order to get the number of packets suuccessfully transmitted by direct link and relay link
    2009-09-13 18:53:37下载
    积分:1
  • dem
    digital terrain model
    2010-06-29 03:55:59下载
    积分:1
  • practice
    线天线阵和面天线阵在MATLAB内的方向图以及半功率带宽(Antenna array and antenna array within the orientation map in MATLAB and the half-power bandwidth of)
    2010-07-04 17:49:17下载
    积分:1
  • Interpolation-Integration
    Interpolation-spline/polynomial interpolation example. Integration-integration using trapezoidal rule (equally spaced data)
    2010-11-16 17:59:20下载
    积分:1
  • motorcycle_model
    MATLAB Simulation文件,摩托车仿真,具体操作步骤见说明文档(MATLAB Simulation file, motorcycle simulation, specific steps see documentation)
    2013-08-15 17:20:21下载
    积分:1
  • exercise319c
    Now interchange the “b” and “w” in the two words “be” and “we.” In splicing, be careful that you capture all important perceptual cues of the two phonemes. What is the effect? Can you interchange the two words by interchanging the two initial phones?
    2015-04-17 16:21:59下载
    积分:1
  • interimreport2
    it contains all the details of the following software requirement specification.
    2010-10-07 13:44:27下载
    积分:1
  • multi-GA
    这是2007年安徽理工大学 多目标遗传算法应用研究硕士论文(This is 2007, Anhui University of application of multi-objective genetic algorithm pp)
    2011-05-25 14:36:52下载
    积分:1
  • DblGEGA
    DblGEGA 用双切点遗传优化求解一维无约束优化问题 (DblGEGA with double tangent point genetic optimization one-dimensional unconstrained optimization problems)
    2012-12-03 23:13:37下载
    积分:1
  • yiqunsuanfaTSP
    说明:  利用蚁群算法解决TSP问题,本例涉及了31个城市并将其坐标化,每个城市只能拜访一次,而且最后要回到初始城市,所选路径为所有路径之中的最小值。(Using ant colony algorithm to solve TSP problem, this example involves 31 cities and coordinates them, each city can only visit once, and finally return to the initial City, the selected path is the minimum of all paths.)
    2019-11-13 16:58:28下载
    积分:1
  • 696524资源总数
  • 103939会员总数
  • 12今日下载