登录
首页 » Others » 49808171

49808171

于 2019-01-05 发布
0 235
下载积分: 1 下载次数: 3

代码说明:

说明:  用冲激响应不变法和双线性变换法设计IIR的MATLAB程序(Design of MATLAB Program for IIR by Impulse response Invariant method and Bilinear Transformation method)

文件列表:

4两种方法.doc, 49152 , 2007-12-02

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

发表评论

0 个回复

  • rfidreader
    rfid实例阅读程序,可实现超高频,高频,低频卡的读写( rfid实例阅读程序,可实现超高频,高频,低频卡的读写 RFID instance reading program, you can achieve ultra high frequency, high frequency, low frequency card read and write)
    2017-05-25 01:32:50下载
    积分:1
  • lucky38
    hangle unicode used AI
    2011-08-30 18:34:33下载
    积分:1
  • shiper
    Воронежский гос университет, задача по сям
    2009-10-11 01:30:49下载
    积分:1
  • FRWS
    Script File for remote restart or shutdown computer
    2011-01-11 03:00:10下载
    积分:1
  • ccode
    包括汉诺塔、杨辉三角、求根值等c程序,在VC++6.0运行没问题。(Including the Tower of Hanoi, Yang Hui triangle, the value of such c rooting process running in VC++6.0 no problem.)
    2010-12-15 08:41:27下载
    积分:1
  • IsSubStr
    从控制台输入一个字符串,然后再输入想要查找的字符串,判断要查找的字符串是不是在第一次输入的字符串中出现过。(find substring in a source string)
    2015-11-17 11:23:43下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • Desktop
    调度问题的回溯算法,算法中的经典问题。问题描述:假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度,使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
    2010-02-19 23:31:11下载
    积分:1
  • caobiao
    基本7022芯片的抄表测试程序.代码与抄表终端一致(Basic 7022 chip meter test procedure. Code consistent with the meter reading terminal)
    2008-05-06 13:59:37下载
    积分:1
  • template
    template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
    2013-07-15 17:33:53下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 31今日下载