登录
首页 » matlab » butterworthbpf

butterworthbpf

于 2013-10-03 发布 文件大小:2KB
0 181
下载积分: 1 下载次数: 4

代码说明:

  Butterworth Bandpass Filter

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

发表评论

0 个回复

  • siftDemoV4
    sift算法进行特征匹配的程序,先检测出关键点,找到两幅图像的关键点连线,里边附有几张图片,效果不错!(code for keypoint match based on sift,the performance is good!)
    2010-12-23 16:32:28下载
    积分:1
  • TwoStep
    说明:  一个关于数值分析的matlab演示,十分有用(A presentation on the numerical analysis matlab, very useful)
    2010-04-16 16:55:51下载
    积分:1
  • jsscx2
    近似熵MATLAB的计算程序2,可以通过此程序对脑电信号EEG进行分析,达到你要的结果。程序仅供参考,里面可能有少许不足之处,希望大家不吝赐教。(approximate entropy MATLAB program two, through this procedure right EEG EEG analysis to achieve the results you want. Procedures for reference purposes only, which may have some shortcomings, we hope that substantive progress has spared no.)
    2007-05-11 10:07:49下载
    积分:1
  • gauss_gen
    高斯白噪声序列的产生-使用瑞利分布, C语言产生1000个点的高斯白噪声序列。(Gaussian white noise sequence to produce- produce 1000 using a Rayleigh distribution point Gaussian white noise sequence)
    2015-01-27 19:13:27下载
    积分:1
  • 0502_2
    基于matlab的8-3编码器,使用模块实现编码,并进行封装(8-3 matlab-based encoder module using coding and packaging)
    2014-07-10 19:44:18下载
    积分:1
  • KNN
    实现K近邻算法,并提供两个数据集的分类、回归测试案例。(Realize the KNN algorithm, meanwhile two test cases including both classification and regression.)
    2018-05-08 14:42:56下载
    积分:1
  • SOR2
    可求解二维变量矩阵的超松弛迭代方法,因此所求解未知量可为二维矩阵。(It is a SOR solver which can be used to solve the 2D unknowns matrix.)
    2010-09-06 16:56:10下载
    积分:1
  • APF_IP_IQ
    基于IP-IQ瞬时功率理论的APF仿真波形图,三相三线,如果需要还可以将三相四线传上来供大家学习交流。(Based on the IP-IQ instantaneous power theory of APF simulation waveform, phase three-wire, if necessary, can be three-phase four-wire pass up for the Learning Exchange.)
    2012-03-23 15:12:05下载
    积分:1
  • IEEE新算法 辅助信源法
    包括王永良课本单辅助信源法,IEEE文献新算法(Auxiliary_source_method,RMSE_Auxiliary_source_DOA)
    2018-01-11 15:12:43下载
    积分:1
  • simAnealing
    Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.
    2010-07-07 12:57:40下载
    积分:1
  • 696516资源总数
  • 106409会员总数
  • 8今日下载