登录
首页 » matlab » fft--demo

fft--demo

于 2013-09-20 发布 文件大小:1KB
0 226
下载积分: 1 下载次数: 2

代码说明:

  matlab写的一个FFT例程,对初学者很有帮助(matlab FFT DEMO)

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

发表评论

0 个回复

  • ff
    Running a function on several files in Matlab
    2013-10-22 18:22:05下载
    积分:1
  • c8bp_pid
    基于S函数BP神经网络的PID控制器的研究与学习,方便简单,实用性特别强。(S function based on BP neural network PID controller research and study, convenient and simple, practical particularly strong.)
    2020-11-10 15:19:46下载
    积分:1
  • hamming_distance
    Hamming distance calculator Calculates the hamming distance between any two bit pattern. The bit pattern must be of same length.
    2010-06-30 03:13:18下载
    积分:1
  • die-dai-suan-fa
    说明:  FDTD迭代算法,可以计算电磁场的光场强度(fdtd simulation)
    2011-04-05 16:11:20下载
    积分:1
  • EntropyThresholding
    Thresholding is a key techniqur for the segmentation and edge detection. this program contained the matlab program for thresholding on the basis of energy entropy of an image.
    2013-07-15 03:22:24下载
    积分:1
  • MATPOWER-OPF-slides-zimmerman
    this is an explanation about matpower
    2020-09-02 03:28:08下载
    积分:1
  • simulation
    仿真人体的心肺活动信号,在I,Q空间获得该信号的I-Q曲线(simulate the heart and lung beat, show the I-Q curve )
    2012-02-01 04:52:44下载
    积分:1
  • 72828202f06f
    高信噪比实测数据线谱提取,使线谱提取的一种典型方法(high signal-to-noise ratio measured spectral line data extraction, spectral lines from a typical method )
    2011-04-27 20:24:31下载
    积分:1
  • 2
    说明:   有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。 现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。 可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入: 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数,每组有一对数字。 输出: 可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
    2015-03-22 23:35:47下载
    积分:1
  • spsp
    spread spectrum simulation
    2011-06-03 02:21:11下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载