Welcome![Sign In][Sign Up]
Location:
Search - fast ft

Search list

[Bio-RecognizeMASM-fft

Description: 汇编语言的FFT算法。速度还比较快,网络上好像还有更快的FT变换算法。-assembly language FFT algorithm. Relatively fast speed, the network seems to be faster on the FT algorithm.
Platform: | Size: 33337 | Author: HJ | Hits:

[Mathimatics-Numerical algorithmsft

Description: 快速傅立叶的变换-the Fast Fourier Transform
Platform: | Size: 2185 | Author: 李锋 | Hits:

[Mathimatics-Numerical algorithmsD12R1

Description: FFT(快速傅立叶变换)的算法实现-FFT (Fast Fourier Transform) algorithm
Platform: | Size: 8192 | Author: | Hits:

[Mathimatics-Numerical algorithmsft

Description: 快速傅立叶的变换-the Fast Fourier Transform
Platform: | Size: 2048 | Author: 李锋 | Hits:

[Bio-RecognizeMASM-fft

Description: 汇编语言的FFT算法。速度还比较快,网络上好像还有更快的FT变换算法。-assembly language FFT algorithm. Relatively fast speed, the network seems to be faster on the FT algorithm.
Platform: | Size: 32768 | Author: HJ | Hits:

[Graph programefficient_registration

Description: 利用傅里叶变换,在频域上对两幅图像配准,是一种比较配准的新方法,但是对弹性配准的效果不是很好 需要进一步的研究。-Registers two images (2-D rigid translation) within a fraction of a pixel specified by the user. Instead of computing a zero-padded FFT (fast Fourier transform), this code uses selective upsampling by a matrix-multiply DFT (discrete FT) to dramatically reduce computation time and memory without sacrificing accuracy
Platform: | Size: 5120 | Author: wangwei | Hits:

[Algorithmftoa.c

Description: This a fast floating point to string conversion function. Avoids the use of unsafe sprintf function. Works with float and double types. Correctly manages +inf, -inf, nnan (not a number).-This is a fast floating point to string conversion function. Avoids the use of unsafe sprintf function. Works with float and double types. Correctly manages+inf,-inf, nnan (not a number).
Platform: | Size: 1024 | Author: steux | Hits:

[matlabcbl

Description:  利用fft()进行快速傅立叶变换,得到频谱,画出正弦函数及其频谱  找出频谱中使得Y轴取最大值时的估计频率记为ft  加入白噪声,绘出信噪比和均方误差的关系曲线 - using fft () for fast Fourier transformation, spectrum, to draw the sine function and its spectrum  find the spectrum makes the Y-axis maximum value when the estimated frequency is denoted by ft  adding white noise, SNR plot and mean square error curve
Platform: | Size: 1024 | Author: xin | Hits:

[Software Engineeringreport_658b

Description: Fast Transversal Recursive least-squares (FT-RLS) Algorithm
Platform: | Size: 1043456 | Author: James Lafleur2 | Hits:

[Graph programefficient_registration

Description: 利用傅里叶变换,在频域上对两幅图像配准,是一种比较配准的新方法,但是对弹性配准的效果不是很好 需要进一步的研究。-Registers two images (2-D rigid translation) within a fraction of a pixel specified by the user. Instead of computing a zero-padded FFT (fast Fourier transform), this code uses selective upsampling by a matrix-multiply DFT (discrete FT) to dramatically reduce computation time and memory without sacrificing accuracy
Platform: | Size: 5120 | Author: nsionlo | Hits:

[Algorithmfast-fourier-transforms-22.1

Description: FT是一种FT的高效算法,称为快速傅立叶变换(fast Fourier transform),它根据离散傅氏变换的奇、偶、虚、实等特性,对离散傅立叶变换的算法进行改进获得的。(FT is an efficient algorithm for DEFT, called fast U Lie transform (fast Fourier transform). It is obtained by improving the algorithm of discrete U Lie transform according to the odd, even, virtual and real properties of the discrete Fourier transform. fast Fourier transform algorithm can be divided into time extraction algorithm and frequency extraction algorithm.First,the basic principle of FT is briefly introduced.)
Platform: | Size: 4170752 | Author: wecol | Hits:

CodeBus www.codebus.net