登录
首页 » matlab » calculation-of-fft

calculation-of-fft

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

代码说明:

  it is a matlab program used to calculate the FAST FOURIER TRANSFORMS of two given sequences

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

发表评论

0 个回复

  • Segmentation
    这是一个虹膜识别检测的周围元器件的程序描述,很完整,也是很好验证的(This is a test of iris recognition around the components of the program description, it is complete and is good for validation)
    2010-07-24 10:18:26下载
    积分:1
  • ABasicCourseinProbabilityTheory
    说明:  一本很好的概率基础入门书籍,比国内的写的好(A Basic Course in Probability Theory)
    2010-04-25 13:22:14下载
    积分:1
  • Solution-of-algebraic-equations
    代数方程组的解法,matlab,希望对大家有用(Solution of algebraic equations, matlab)
    2012-06-27 10:53:47下载
    积分:1
  • floaterK1
    这是用MTTLAB编程,采用K近邻法对提取的水面漂浮物特征进行分类(This is programming MTTLAB, K-nearest neighbor method floats feature to classify the extracted water)
    2013-04-29 11:31:30下载
    积分:1
  • LMS
    LMS算法的仿真程序,主要实现LMS算法的仿真与收敛的仿真,我已经运行过。(LMS algorithm simulation program, the main LMS algorithm to achieve convergence of the simulation and the simulation, I have been running.)
    2009-04-25 10:51:04下载
    积分:1
  • angular_distribution
    说明:  计算分子流态下气体分子通过直圆管道时的角度分布的数值解(Calculation of gas molecules under molecular flow through straight circular pipes of the angular distribution of the numerical solution)
    2010-04-22 09:48:55下载
    积分:1
  • roadb
    可以根据不同需要,生成各级路面的空间路面谱(According to different needs, generate a spectrum at all levels of road space road)
    2011-09-06 11:55:11下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • kenstone
    主要用于建模校正集和预测集样品的选择。近红外光谱模型(Mainly used for modeling calibration set and prediction set of samples to choose from.)
    2015-09-10 15:29:20下载
    积分:1
  • 2007062703
    1.掌握图像滤波的基本定义及目的; 2.理解空域滤波的基本原理及方法; 3.掌握进行图像的空域滤波的方法。 (1. Image filtering grasp the basic definition and purpose; 2. Understanding of spatial filter the basic principles and methods; 3. master images of the spatial filter method.)
    2007-06-29 10:15:30下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载