登录
首页 » matlab » a1

a1

于 2011-04-27 发布 文件大小:1KB
0 210
下载积分: 1 下载次数: 0

代码说明:

说明:  本程序为将最小均方自适应算法用于二阶横向滤波器,实现权向量分析(This program is the least mean square adaptive algorithm for second-order transversal filter to achieve the right of vector analysis)

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

发表评论

0 个回复

  • coherence_MVDR
    基于MVDR算法,计算两个信号的相关性的函数。(This program computes the coherence function between 2 signals x1 and x2 with the MVDR method. This algorithm is based on the paper by the same authors: J. Benesty, J. Chen, and Y. Huang, "A generalized MVDR spectrum," IEEE Signal Processing letters, vol. 12, pp. 827-830, Dec. 2005. x1, first signal vector of length n x2, second signal vector of length n L is the length of MVDR filter or window length K is the resolution (the higher K, the better the resolution))
    2009-03-20 01:04:30下载
    积分:1
  • edgedet
    used in the detection of edges in the image given
    2011-05-13 23:54:05下载
    积分:1
  • svm_lssvm
    支持向量机的模式识别的经典算法--最小平方支持向量机(SVM pattern recognition algorithm classic-- the smallest square SVM)
    2007-01-08 11:33:33下载
    积分:1
  • introductionMATLAB
    its great to share codes because am watching how interesting it is
    2010-12-01 01:39:28下载
    积分:1
  • JDO
    JDO的学习资料,自己整理了一本分,是值得学习的东西(JDO' s learning materials, their order a part, is something to be learned)
    2010-05-07 16:35:58下载
    积分:1
  • ReadSegy
    MATLAB程序源码,用于读取地震波数据segy格式的文件(read seis-segy file)
    2014-10-23 17:16:43下载
    积分:1
  • mc-bpsk
    monte carlo bpsk ber delay
    2013-12-16 09:42:20下载
    积分:1
  • Non-classical-receptive-n
    视觉注意的资料罗四维老师的资料PPt,非经典感受野抑制的代码用于轮廓提取,(Luo dimensional visual information for the attention of information teachers PPt, non-classical receptive field inhibition of the code for contour extraction,)
    2011-05-18 21:00:27下载
    积分:1
  • cs-code
    Sparse Recovery Experiments with Sparse Matrices
    2011-09-02 12:19:27下载
    积分:1
  • L01p_e
    [x,f]= L01p_e(c,A,b,N)用枚举法求解下列 0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式,N= 0时可以省略。 返回结果x是最优解,f是最优解处的函数值。 ([X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.)
    2013-07-16 21:51:03下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载