登录
首页 » matlab » AGuideToTheFFT_2ndEd

AGuideToTheFFT_2ndEd

于 2007-04-24 发布 文件大小:144KB
0 160
下载积分: 1 下载次数: 129

代码说明:

  实现快速傅立叶变换的程序,是matlab下的M文件,内部还和含有一个介绍PDF文件(fast Fourier transform procedures, the Matlab M paper Internal also contains an introduction and PDF files)

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

发表评论

0 个回复

  • denoise2
    本程序是基于LeventCode平台作的。包括以下方法:BivaShrink方法、模型1、模型2、模型3(TrivaShrink方法)、BayesShrink方法、LAWMLShrink方法的DWT实现和DT_CWT实现(This procedure is based on the platform for LeventCode. Including the following methods: BivaShrink method, model 1, model 2, model 3 (TrivaShrink method), BayesShrink methods, LAWMLShrink methods DWT realize and realize DT_CWT)
    2007-10-22 20:57:25下载
    积分:1
  • optical-flow-lucas-kanade
    descibes optical flow using lucas kanade algorithm. Example supplied help people understand easily
    2013-07-24 13:05:05下载
    积分:1
  • dtw2
    matlab代码,对输入的语音信号进行端点检测程序源码,改进的dtw算法。(Matlab code, the input voice signal endpoint detection program source code.)
    2013-04-18 20:27:49下载
    积分:1
  • scriptofdmtx
    在发射端产生OFDM信号,生成信号的波形已被画出。(OFDM signal generated at the transmitter side, the signal generated waveform is drawn.)
    2013-05-25 21:20:00下载
    积分:1
  • matlab-kalman-filter
    卡尔曼滤波,实现跟踪滤波分析,数据随机产生(kalman filter and tracking problem)
    2013-01-22 22:47:21下载
    积分:1
  • image-tracking-procedures
    Matlab基于卡尔曼的视频序列帧图像的跟踪程序(Matlab based Calman frames of a video sequence image tracking procedures)
    2012-08-31 10:44:00下载
    积分:1
  • main
    这是个casio DT-930 的展示程序,(This is a casio DT-930' s display program,)
    2010-09-07 13:28:14下载
    积分:1
  • mixturecode
    This is a mixture distribution fitting algorithm in Matlab
    2010-11-23 16:13:09下载
    积分:1
  • ESPRINT
    ESPRINT谱估计,计算DOA,可以与capone进行对比。(ESPRINT spectrum estimation calculates DOA, with capone comparison.)
    2013-12-18 09:55:08下载
    积分:1
  • Recursive_integer_division
    递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
    2014-02-06 14:21:38下载
    积分:1
  • 696518资源总数
  • 105873会员总数
  • 12今日下载