The computer simulation of continuous channels based on the algorithm of FFT is proposed.
提出基于快速傅立叶交换的连续信道的计算机模拟。
Comparing with existing prime factor FFT algorithms, this algorithm saves about half of the storage and possesses a higher efficiency.
与现在的素因子fft算法相比较，这种算法不仅节省了约一半内存，而且有更高的计算效率。
Basic theory of spectrum analysis and Fast Fourier Transform (FFT) algorithm are briefly introduced.
简介了频谱分析的基础理论和快速傅利叶变换(FFT)算法。
On the basis of the features of the Fast Fourier Transform (FFT) and digitally modulated signals, this paper proposes a blind channel estimation algorithm.
根据快速傅里叶变换(FFT)和数字信号调制解调的特点，给出了一种盲信道质量估计算法。
The Fast Fourier Transform (FFT) is one of the most important algorithm of real-time signal processing. It's widely used in EW receivers.
FFT是电子战接收机信号处理的关键算法之一，在数字EW 接收机中有着广泛的应用前景。
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算法，着重分析算法的通信复杂性，并在此基础上导出算法的加速比。
Based on the analysis of the complexity and hardware architecture of FFT, the proposed processor adopts radix-4 DIF algorithm, pipelined architecture and fixed-point operation.
在分析了FFT算法的复杂度和硬件实现结构的基础上，处理器采用了按频率抽取的基- 4算法，分级流水线以及定点运算结构。
On the basis of traditional serial FFT algorithms, a parallel FFT algorithm based on multi-threading is put forward.
在传统的串行FFT算法基础上提出了一种基于多线程技术的并行FFT算法。
For rectangular window FFT interpolation algorithm, the negative frequency components of harmonic components have a greater impact on the fundamental calculation error.
采用加矩形窗fft插值算法，谐波的负频分量对谐波计算的误差影响较大。
It is easy to implement this algorithm on pipeline processors and to divide an N-point FFT for a large N into some short ones because of an easy way to rotate the factors.
该算法便于流水处理，只有一次简单的数据通讯，而且旋转因子规律简单易于将大点数FFT拆分成小点数FFT。
Mainly, FFT algorithm and full-wave Fourier algorithm are discussed. Calculation of active power and imaginary power is researched. Parameter selection of filtration and calculation of are attained.
主要就快速傅里叶变换算法、全波傅氏算法以及有功功率、无功功率的计算、滤波的参数选取、谐波的计算进行了讨论。
The numerical results of a typical space target indicate that FFT-based united algorithm can provide clear ISAR images with high contrast and the decoupled algorithm is computationally efficient.
针对典型空间目标的成像结果表明，基于FFT的二维联合算法获得的图像较为干净，目标背景对比度高； 二维解耦算法运算速度更快。
Under the conditions of meeting the real time imaging and given resolution, the algorithmic speed required by the system is analyzed. And an improved FFT algorithm and its implementation are given.
在满足实时成像和一定分辨率的条件下，分析了系统对运算速度的要求，提出了一种改进的快速傅里叶算法及其实现方法。
Based on the fast Fourier transform (FFT) algorithm, the wave-front reconstruction algorithm of Shack-Hartmann sensor is described.
提出了一种应用快速傅里叶变换算法提高哈特曼夏克波前传感器波前重构实时性的快速算法。
This system has adopted the algorithm of digital down convert FFT, so the frequency resolution is improved greatly.
使用先进的数字信号处理器，缩减了分立元件的数量，提高了系统的稳定性和扫频的速度；
Using the parallel operation capability of DSP, the operation cycles of FFT and tap-weight update can be shorten and the real-time capability of the optimized algorithm can be easily met.
利用DSP的并行运算能力，缩短了FFT和权值更新的运行周期，因此优化后的算法很容易达到实时性。
The displacement signals of ten test positions in the system were processed with FFT Algorithm and basic spectrum features were extracted.
通过对位移信号的快速FFT变换，分析了系统振动信号的基本特征，研究了双侧转子对中间轴颈振动的影响；
Employing the Fast Fourier Transform Algorithm (FFT) to determine the initial tap coefficients of equalizers is fundamentally different from using the current iteration method.
用快速离散傅立叶变换(FFT)的方法确定均衡器的初始抽头系数，它区别于目前常用的迭代算法。
The result of research shows that the best architecture of the parallel FFT algorithm is hypercube architecture.
经研究表明，并行fft算法的最佳体系结构为超立方体。
In this algorithm, a "iterated harmonic-group clean algorithm" is presented to obtain the estimates of the parameters of the harmonic signal based on FFT.
其中提出了一种基于FFT的“谐波组迭代清除算法”来估计谐波信号的参数，并根据“谐波图”的值来确定谐波信号的个数。
According to the basic principles of FFT algorithm, this paper analyzes each instance of start time values sampled in harmonic measuring and the data obtained from anytime start sampling.
根据FFT算法的基本原理，对谐波检测中采样起始时刻取不同值的各种情况进行分析，并对任意时刻开始采样得到起始点的数据情况进行分析。
A way of digital phase detector applied to the laser phase distance measurement system is introduced in this paper, which is based on DSPs and FFT algorithm.
本文介绍了应用于激光相位式测距中的一种数字相位计的实现方法，该方法是基于DSP器件运用FFT算法完成的。
After deeply studied in the fast Fourier transform (FFT) method, this paper presents an improved FFT algorithm considering the half-wave symmetric characteristic of power system signals.
在深入分析快速傅里叶变换(FFT)方法的基础上，针对一类电网信号具有半波对称性的特点，提出了一种改进的FFT算法。
In calculation, FFT algorithm is used to develop the speed of computation.
计算中采用了FFT算法，提高了计算速度。
The result of the experiment demonstrates that the presented algorithm is about 30% faster than the abroad used public domain FFT package FFTW.
实验结果表明：描述的算法比目前使用最广泛的公共域FFT程序包FFTW快30%左右。
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快速实现，而循环相关方法则具有很高的频率估计精度和很好的抗噪性能。
The algorithm of interpolation of hanning Windows FFT reduce the spectral leakage error and the interference between harmonics.
加窗插值fft算法减小了频谱泄漏误差和降低了谐波之间的相互干扰的影响。
Through simple transforms of FFT algorithm, the amending algorithm can reduce satisfactorily the leakage error, and obtain accurate analysis results.
该算法通过对FFT算法做简单变换，减小了频谱泄漏误差，降低了谐波之间的相互干扰。
Through simple transforms of FFT algorithm, the amending algorithm can reduce satisfactorily the leakage error, and obtain accurate analysis results.
该算法通过对FFT算法做简单变换，减小了频谱泄漏误差，降低了谐波之间的相互干扰。
应用推荐