登录
首页 » matlab » LRtoHR

LRtoHR

于 2012-04-08 发布 文件大小:1KB
0 292
下载积分: 1 下载次数: 2

代码说明:

  z_tranform for advanced digital signal processing lab

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

发表评论

0 个回复

  • feibonaqie
    斐波纳契数列在现代物理、准晶体结构、化学等领域都有直接的应用,为此,美国数学会从1960年代起出版了《斐波纳契数列》季刊,专门刊载这方面的研究成果。 (Fibonacci series in modern physics, quasi-crystalline structure, chemical and other fields have direct application, for which the American Mathematical Society published since the 1960s, " Fibonacci series" quarterly, is devoted to research in this area .)
    2011-01-17 21:16:29下载
    积分:1
  • gabor
    cgftezydnh,nvvnv nhfjglgjh uoygjgj juyiglkbj,m uyjg jjh
    2013-01-29 18:41:04下载
    积分:1
  • lab_1
    用 Matlab MatlabMatlab Matlab对标注测试图像进行集合运算(加、减乘除放大缩小)(Using Matlab MatlabMatlab Matlab on the mark test image set operations (addition, subtraction, multiplication and division zoom))
    2010-07-01 15:00:42下载
    积分:1
  • zigzag
    zig zag code using matlab
    2010-12-06 03:54:12下载
    积分:1
  • xunhuanpu
    循环谱的matlab程序,很实用,适合初学者使用,(Cyclic spectrum of the matlab program, very useful for beginners,)
    2011-06-19 16:00:02下载
    积分:1
  • ProUnit6
    米字序贯,是传统序贯法的一种变异,可以处理一些特殊的多普勒回波(M word sequential is a variation of the traditional sequential method that can handle some special Doppler echo)
    2012-07-07 11:42:07下载
    积分:1
  • nansum
    Sum of values ignoring NaNs
    2013-11-25 00:31:00下载
    积分:1
  • upfc
    These files gives information of unified power flow control
    2010-08-03 00:30:59下载
    积分:1
  • YTY_GA_Final
    To find the largest fitness value and its location 寻找最大适应性及相应的位置! Population N=50;crossover bits=n/2 (half of bits of an individual) with random locations,mutation bits = 4 种群数 N=50,交换位数= n/2, 即个体位数的一半,且位置随机; 变异位数统一取为4; Nc=20,28,36,44,individuals for crossover(交换的个数)。 Nm=1,5,10,15, individuals for mutation(变异的个数)。 (To find the largest fitness value and its location to find the location of the maximum adaptability and the corresponding! Population N = 50 crossover bits = n/2 (half of bits of an individual) with random locations, mutation bits = 4 population size N = 50, exchange digits = n/2, ie half of the median individual, and random position variation is taken as unity median 4 Nc = 20,28,36,44, individuals for crossover (exchange number). Nm = 1,5,10,15, individuals for mutation (the number of variations.))
    2010-12-27 21:23:27下载
    积分:1
  • dalin
    说明:  大林算法的阶跃响应程序,基于大林算法,解决了振铃问题,(Dahlin step response procedures, based on Dahlin algorithm to solve the ringing problem)
    2010-04-23 21:50:20下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载