登录
首页 » Visual C++ » fft

fft

于 2011-05-30 发布 文件大小:1KB
0 326
下载积分: 1 下载次数: 8

代码说明:

  FFT快速傅里叶变换,用于数字信号处理,大大提高了运行速度,节省内存开销。C语言实现(FFT fast Fourier transform for digital signal processing, greatly improving the speed and save memory overhead. C language)

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

发表评论

0 个回复

  • kalman
    实现卡尔曼滤波算法,可以进行参数估计、插值、滤波和预报(The Kalman filter algorithm, parameter estimation, interpolation, filtering and prediction)
    2012-12-27 19:24:51下载
    积分:1
  • 19864062MatrixOper
    对于协方差矩阵的一种计算方法,对于地震中的反演约束算法能起到很好的作用。(For a kind of covariance matrix calculation method)
    2011-05-30 13:43:06下载
    积分:1
  • plrc_fdtd
    一维等离子体的plrc—fdtd算法程序(one-dimensional plasma plrc- fdtd Algorithm)
    2006-10-01 09:29:56下载
    积分:1
  • interp1_interp2
    C语言实现Matlab中interp1和interp2中的功能。(Interp1 and interp2 in Matlab, C language the function.)
    2021-03-29 14:39:11下载
    积分:1
  • projection
    CT迭代重建算法中3维投影矩阵的生成算法,该算法对学习计算机断层层析成像很有帮助。(CT image reconstruction projection ,3D)
    2012-10-26 23:46:42下载
    积分:1
  • PSO
    针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足,本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化,并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率,提高解的精确,同时还保持了较低的计算复杂度,具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)
    2013-01-07 18:05:35下载
    积分:1
  • LL1 grammer
    vc++实现编译原理中的LL(1)文法的编译过程,非常好用.(vc realization of the principle of compiler LL (1) grammar compiler course, very handy.)
    2005-07-03 21:22:30下载
    积分:1
  • 3
    说明:  用刷选法求出100之内的素数。并输出数有多少个。(100 prime number is calculated by the method of selection. And the output count how many.)
    2013-09-11 19:40:35下载
    积分:1
  • srfft
    计算复序列的分裂基快速傅里叶变换,分裂基快速算法是将基2和基4分解组合而成。在基2M类快速算法中,分裂基算法具有最少的运算量,且仍保留结构规则、原位计算等优点。(Calculate complex sequence of split radix fast Fourier transform, fast algorithm is to split the base base 2 and base 4 decomposition combination. 2M fast algorithm in the base class, the split-based algorithm has the least amount of computation and structural rules remain in situ calculation and so on.)
    2013-05-23 19:56:04下载
    积分:1
  • naturePoly
    在Z2[X]中判断一个多项式是否本原多项式,并能对给定的多项式求逆。 (in Z2 [X] to judge whether a polynomial primitive polynomial, and the right to the inverse polynomials.)
    2007-05-21 14:57:08下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载