登录
首页 » matlab » FFT

FFT

于 2013-12-11 发布 文件大小:575KB
0 68
下载积分: 1 下载次数: 6

代码说明:

  FFT sample matlab code

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

发表评论

0 个回复

  • Simpson
    这是用复化simpson方法求解数值积分的一种方法(This is the method used to solve complex numerical integration of the simpson' s method)
    2011-07-15 23:15:58下载
    积分:1
  • music
    此代码属于music基础算法的matlab仿真源码,对于空间任意方向上的信号通过music测算出其方向的方法。(This code belongs to the music-based algorithm matlab simulation source code, measure the direction signal through space in any direction on the music.)
    2013-05-01 16:38:42下载
    积分:1
  • LTE2
    说明:  讲述LTE技术创新与挑战的很有价值的参考资料,值得去读(About the challenges of LTE technology, innovation and valuable reference, it is worth to read)
    2010-03-26 23:12:47下载
    积分:1
  • Stochastic_Bosque
    Creates an ensemble of cart trees similar to the matlab TreeBagger class
    2011-05-13 02:13:00下载
    积分:1
  • shiyan1
    M/M/1单服务台或M/M/S(n)排队系统仿真 (用事件调度法实现离散事件系统仿真) (M/M/1 single desk or M/M/S (n) Queuing System Simulation (Event Scheduling Method using Discrete Event System Simulation))
    2007-09-13 00:21:56下载
    积分:1
  • bisect2
    Minor modification of the function "bisect"
    2009-11-13 19:02:22下载
    积分:1
  • BCC
    this program is a code for DEA, BCC model in matlab programming . I hope that can help you.
    2013-09-23 21:32:44下载
    积分:1
  • caltime
    遗传算法解决作业车间调度问题,,这一M文件计算工序的加工顺序与加工时间(Genetic algorithms to solve the job shop scheduling problem,, the M-file to calculate the value of the objective function.)
    2015-04-15 15:30:03下载
    积分:1
  • Transformer-and-Induction-Motor
    RLC CIRCUIT OF CIRCUIT ANALYSIS IN MATLAB
    2014-11-27 23:41:40下载
    积分:1
  • GraphTheoryAlgorithmMATLAB
    说明:  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
    2010-03-28 15:39:29下载
    积分:1
  • 696518资源总数
  • 104226会员总数
  • 47今日下载