搜索资源列表
MASM-fft
- 汇编语言的FFT算法。速度还比较快，网络上好像还有更快的FT变换算法。-assembly language FFT algorithm. Relatively fast speed, the network seems to be faster on the FT algorithm.
ft
- 快速傅立叶的变换-the Fast Fourier Transform
D12R1
- FFT（快速傅立叶变换）的算法实现-FFT (Fast Fourier Transform) algorithm
efficient_registration
- 利用傅里叶变换，在频域上对两幅图像配准，是一种比较配准的新方法，但是对弹性配准的效果不是很好 需要进一步的研究。-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 upsamp
ftoa.c
- 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. Av
cbl
- 利用fft()进行快速傅立叶变换，得到频谱，画出正弦函数及其频谱 找出频谱中使得Y轴取最大值时的估计频率记为ft 加入白噪声，绘出信噪比和均方误差的关系曲线 - using fft () for fast Fourier transformation, spectrum, to draw the sine function and its spectrum find the spectrum
efficient_registration
- 利用傅里叶变换，在频域上对两幅图像配准，是一种比较配准的新方法，但是对弹性配准的效果不是很好 需要进一步的研究。-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 upsamp
fast-fourier-transforms-22.1
- 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