登录
首页 » matlab » HilbertAvgPitch

HilbertAvgPitch

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

代码说明:

  HILBERTAVERAGE PITCH CALCULATION

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

发表评论

0 个回复

  • gaussJordanelim
    The code gives an automatic solutions of simultaneous equations using gauss seidal elimination numerically. The equations must be inputted by the user accordingly.
    2013-11-11 01:59:24下载
    积分:1
  • TCRT1000
    The TCRT1000/ TCRT1010 have a compact construction where the emitting-light source and the detector are arranged in the same direction to sense the presence of an object by using the reflective IR-beam from the object. The operating wavelength is 950 nm. The detector consists of a phototransistor.
    2013-12-19 15:17:55下载
    积分:1
  • compare
    能够有效比较FAN和TDOA和泰勒级数展开法三种不同算法在三维定位的优劣性!(Can effectively compare FAN and TDOA and Taylor series expansion method in three different algorithms in three-dimensional positioning and inferiority!)
    2016-09-28 15:42:02下载
    积分:1
  • MATPOWER
    MATLAB CODE FOR POWER FLOW
    2014-01-06 19:52:24下载
    积分:1
  • matlab
    学习matlab的很好的教程,特别适合于初学者,简单,通俗,好!(Some useful materials for matlab studies. )
    2010-07-09 14:21:56下载
    积分:1
  • Matlab_for_nonlinear_PDEs-0.0.6
    一个有用的非线性微分方程的matlab程序集(A useful matlab package for nonlinear PDEs)
    2010-01-22 11:58:15下载
    积分:1
  • Gradient-Descent
    最小梯度下降算法,有测试实例,可以直接运行。求最小值,回归都可以(The minimum gradient descent algorithm, test cases can be run directly. For the minimum, return all OK)
    2014-10-14 14:05:50下载
    积分:1
  • Ritz_solution
    Ritz法解决-u +u=x 0<x<1,u(0)=0,u(1)=0的有限元边值问题。精确解为u(x)=1/(exp(1)-1/exp(1))*exp(-x)+1/(1/exp(1)-exp(1))*exp(x)+x,基函数为g(i)=sin(i*pi*x)(This matlab code is used to solve the boundary value problem of the differential equation: -u +u=x 0<x<1,u(0)=0,u(1)=0, where the accurate solution is : u(x)=1/(exp(1)-1/exp(1))*exp(-x)+1/(1/exp(1)-exp(1))*exp(x)+x)
    2011-05-30 20:14:35下载
    积分:1
  • DL-snr
    自适应稳健波束形成对角加载算法,其与输入信噪比的关系。(beamforming algorithm)
    2021-02-21 17:39:42下载
    积分:1
  • cwq
    用递归法将一个整数n转换成字符串(例如输入4679,应输出字符串“4679”),n为不确定数,可以是位数不超过5,且数值在-32768~32767之间的任意整数。 (Recursive method to convert a string to an integer n (for example, type 4679, should output the string " 4679" ), n is the number of uncertainty, which can be not more than 5 digits, and the values in an arbitrary-32768 ~ 32767 integer.)
    2010-01-12 20:53:47下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载