FFT
abbr. 快速傅氏变换算法(Fast Fourier Transform Algorithm)
2025-09-07 04:06 浏览次数 7
abbr. 快速傅氏变换算法(Fast Fourier Transform Algorithm)
1. for further transfer
fft arithmeticfft算法
interpolated fft插值fft
fft FFT快速傅里叶变换
FFT transformationFFT变换
FFT processingFFT处理
improved FFT改进FFT
FFT分析FFT analysis
FFT analysisFFT分析
DFT method can be fast implemented on DSP platform by the use of FFT algorithm, while the method of cyclic correlation has better noise immunity performance and high estimation accuracy.
离散傅立叶变换方法能够在DSP平台上通过FFT快速实现,而循环相关方法则具有很高的频率估计精度和很好的抗噪性能。
Although FFT is the efficient approach in harmonic measurement fields, it results in spectral leakage, which affects the accuracy of measurement.
FFT是谐波测量中使用最广的方法之一,但利用其进行测量时存在着频谱泄漏,影响测量结果準确性。
Comparing the recovered results of FFT with the displacement obtained by the iteration method shows that the approach proposed in this paper indeed improves the estimation of the ground displacement.
对FFT和所介绍的迭代方法所给出的恢复结果进行比较表明,本文所提出的方法确实改善了地面位移的估计。
Results of the study showed that adolescents in the FFT group recovered from their depression faster and stabilized four weeks sooner than those in the enhanced care group.
研究结果显示FFT组的青少年从抑郁中恢复要比增强看护组快,且四周后基本稳定。
The dynamic vibration information is gained from acceleration meter, and then by FFT analysis, the frequency information of vibration is used as the training specimen of neural network.
首先利用测振传感器获得转子的振动信息,然后用FFT分析,将振动信号的频谱分析作为神经网络的训练样本。
This paper studies the FFT analysis and the synthesis method of the symmetric coupler curves in mechanism.
本文对机构学中对称连桿曲线的FFT分析和综合方法进行了研究。
The computer simulation of continuous channels based on the algorithm of FFT is proposed.
提出基于快速傅立叶交换的连续信道的计算机模拟。
Fabio Capello told FFT that he「d told you to 「stay in front of the goal」.
法比奥?卡佩罗在接受FFT采访时说道,他曾让你「一直站在球门前面」。
It is impossible to avoid noise at high temperature, so different mathematic methods, such as Savitzky-Golay method, FFT and wavelet methods have been adopted for denoising.
由于高温噪声的不可避免,采用了移动平均方法,傅里叶变换滤波和小波分析的方法对其进行了数据降噪处理。
It」s apparently difficult to meet the requirement of accuracy by using of FFT directly.
在测量精度要求较高的场合,直接利用FFT频谱估计显然无法达到精度要求。
FFT for inputs of the ANN is used to improve and speed up the training procedure.
神经元网络的输入经过快速付氏变换可以大大提高网络的训练速度。
Compared with the original two kinds of Phase-Difference Correction, only one sequence of time-domain signal is sampled and FFT analysis of same points is performed twice in this method.
与原两种相位差法相比,这种方法只采一段时域信号,且进行两次相同点数的FFT分析。
This paper proposes a set of distributed algorithms for FFT computing which is very simple as well as efficient.
本文提出一组计算FFT的分布式算法,它具有高效率、对系统要求简单的职能。
Considering the uncertainty of frequency excursion, the scheme of signal capturing of correlate searching, FFT capturing is bring forward.
考虑到短波信道频率偏移的不确定性提出了相关搜索、FFT捕获的信号捕获方案。
Comparing with existing prime factor FFT algorithms, this algorithm saves about half of the storage and possesses a higher efficiency.
与现在的素因子fft算法相比较,这种算法不仅节省了约一半内存,而且有更高的计算效率。
Traditional FFT can effectively analyze the sinusoidal signal, but the very big error exists for analyzing the similar frequency sinusoidal signal.
传统的快速傅里叶变换(FFT)可以有效地对正弦信号进行分析,但对于分析频率相近的正弦信号却存在很大的误差。
This paper discusses the parallel FFT algorithm on the hypercube architecture. Based on the analysis of the communication complexity, the speedup of the algorithm is derived.
本文讨论超立方体结构上的并行fft算法,着重分析算法的通信复杂性,并在此基础上导出算法的加速比。