助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   快速傅立叶变换 的翻译结果: 查询用时:1.857秒
图标索引 在分类学科中查询
所有学科
电信技术
电力工业
自动化技术
无线电电子学
计算机软件及计算机应用
物理学
数学
金属学及金属工艺
计算机硬件技术
更多类别查询

图标索引 历史查询
 

快速傅立叶变换     
相关语句
  fft
     FFT Processor Design Based on FPGA
     基于FPGA的快速傅立叶变换(FFT)处理器的设计
短句来源
     The results of performance analysis of an 8-point asynchronous FFT processor show that the average case response time 31.15 ns is only 72.7% the worst-case response time 42.85 ns.
     通过对一个8点的异步快速傅立叶变换处理器电路仿真,得到该处理器的平均响应时间为31.15 ns,仅为最差响应时间42.85 ns的72.7%.
短句来源
     Numerical Solution of Fokker-Planck-Landau Equation by FFT Technique
     快速傅立叶变换用于Fokker-Planck-Landau方程的数值求解
短句来源
     Using Mallat algorithm on the basis of wavelet transform and multiresolution analysis(MRA) in connection with traditional FFT,a new speech signal fundamental frequency detection method is presented.
     将基于小波变换与多分辨分析 (MRA)下的Mallat算法与传统的快速傅立叶变换(FFT)相结合 ,提出了一种新的语音信号的基音频率检测方法。
短句来源
     Aiming at the requirements of improving fault detection and expanding applicability in locomotive transient fault recorder, Fast Fourier Transform (FFT) is implemented in floating-point DSP TMS320VC33 based on FFT algorithms features, then the system acquires ability of spectrum analysis and can be applied in field of harmonics analysis and vibration analysis.
     针对当前机车故障诊断记录系统故障诊断能力提高和通用性扩展的需要,结合FFT算法特点,采用TMS320VC33实现快速傅立叶变换,使系统具备了频谱分析的能力,可以应用到谐波分析和振动分析等相关领域。
短句来源
更多       
  fast fourier transform
     Accomplishment of Fast Fourier Transform in TMS320F206
     快速傅立叶变换(FFT)在TMS320F206上的实现
短句来源
     Origin data analysis included simple math, statistics, fast fourier transform, data smoothing and filtering.
     Origin数据分析简单数学运算,统计分析,快速傅立叶变换,数据平滑和滤波,基线和峰值分析等强大的分析工具;
短句来源
     Next, Fast Fourier Transform Algorithm, i_p,i_q Algorithm and Spectrum Estimation in harmonics detection of separate frequency.
     然后,介绍了常用的谐波检测方法,具体分析了快速傅立叶变换,提出了基于i_p,i_q的谐波分频检测方法,对比了基于谱估计的谐波检测方法;
短句来源
     An Outline of the Fast Fourier Transform Algorithm
     快速傅立叶变换算法概述
短句来源
     Outline of Fast Fourier Transform Algorithm
     快速傅立叶变换算法概述
短句来源
更多       
  fast fourier transformation
     In most programming languages, the adopted forms of fast Fourier transformation and inverse transformation are opposite to the forms adopted in nonlinear optics.
     而在大多数编程语言中其快速傅立叶变换正逆变换形式是与非线性光学中应采用的傅立叶变换正逆形式恰好相反,因此时而出现一些错误的计算结果.
短句来源
     Afterward, we chiefly introduce Monte Carlo method and fast Fourier transformation and micromagnetism (FFTM).
     然后重点介绍了蒙特卡罗方法和快速傅立叶变换微磁学方法。
短句来源
     Fast Fourier transformation is an effective, practical DFT algorithm.
     快速傅立叶变换是一种有效、实用的信号DFT算法。
短句来源
     This paper also introduces the iterative algorithms combined with the Nonuniform fast Fourier transformation(NUFFT) algorithm developing recently to solve the electromagnetic field integral equation.
     本文还介绍迭代算法结合近来发展的不等间距快速傅立叶变换算法(NUFFT)求解电磁场积分方程。
短句来源
     After fast Fourier transformation,the noisy current can be differentiated and be used to determine its density distribution.
     在数据处理中 ,采用了快速傅立叶变换滤波的办法来消除微小电流测量结果中的噪声 ,从而可以对S形电流曲线进行微分 ,得到束流密度空间分布。
短句来源
更多       
  fast fourier transforms
     And the digital synthesis filters were implemented by means of the optimization method based on inverse fast Fourier transforms.
     采用遗传算法实现了功率互补对的优化设计,并基于逆快速傅立叶变换(IFFT)实现了数字综合滤波器的设计以保证近似完全重构.
短句来源
     Based on fast Fourier transforms (FFT) of the sensor array output data, a relationship between the FFT spectrum and direction-of-arrival angles is established so that the angles can quickly be estimated through searching peaks in the FFT spectrum.
     与传统DOA估计算法完全不同,该算法通过对阵列输出数据的快速傅立叶变换(FFT),建立了FFT频谱与波达方向角的关系;
短句来源
     Main ideas as follows:Research of audio digital watermark Algorithm based on Fast Fourier Transforms and psychoacoustic auditory model.
     主要工作有:基于快速傅立叶变换与声学模型的音频数字水印算法研究。
短句来源
     The quadrature modulation and demodulation of each subchannel can be realized with fast Fourier inverse transformation (IFFT) and fast Fourier transforms (FFT). IFFT and FFT can be easily implemented with the development of large scale integrated circuit technology and the DSP technology.
     OFDM 各个子信道的正交调制和解调可以通过采用快速傅立叶反变换(IFFT)和快速傅立叶变换(FFT)来实现,而随着大规模集成电路技术和DSP 技术的发展,IFFT 和FFT 都是非常容易实现的。
短句来源
     In the paper the development of the power quality analysis instrument based on DSP was introduced,the principle of circuit modules was discussed in detail,dis-solved the problem of data overflow caused by fast Fourier transforms with fixed-point DSP,presented calculating method of each power parameter at the same time.
     主要介绍了基于DSP芯片TMS320F206的电网质量分析仪的研制方法,对各模块电路的工作原理进行了重点讨论,分析并解决了用定点DSP实现快速傅立叶变换时的数据溢出问题,同时给出了各种电力参数的计算方法。
短句来源
更多       

 

查询“快速傅立叶变换”译词为其他词的双语例句

 

查询“快速傅立叶变换”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  fft
Spherical harmonic series have many of the same wonderful properties as Fourier series, but have lacked one important thing: a numerically stable fast transform analogous to the Fast Fourier Transform (FFT).
      
We use the decomposition of a group into double cosets and a graph theoretic indexing scheme to derive algorithms that generalize the Cooley-Tukey FFT to arbitrary finite group.
      
Moreover, the approach is more computationally efficient for there are no time-consuming correlations or fast Fourier transform (FFT) operations needed in the range-Doppler domain and only part of the range cells are used in the calculation.
      
This study investigated the dynamic modulus of elasticity (DMOE) of wood panels of Fraxinus mandshurica, Pinus koraiensis, and Juglans mandshurica using the natural frequency measurement system of fast Fourier transform (FFT).
      
For all of these species, the correlation between ES, EF and EL is more significant than the individual species, which indicated that the FFT method is universal.
      
更多          
  fast fourier transform
This article genralizes the fast Fourier transform algorithm to the computation of Fourier transforms on compact Lie groups.
      
These results may all be viewed as generalizations of the fast Fourier transform algorithms on the circle, and of recent results about Fourier transforms on finite groups.
      
Spherical harmonic series have many of the same wonderful properties as Fourier series, but have lacked one important thing: a numerically stable fast transform analogous to the Fast Fourier Transform (FFT).
      
In this article we describe a non-equispaced fast Fourier transform.
      
Moreover, the approach is more computationally efficient for there are no time-consuming correlations or fast Fourier transform (FFT) operations needed in the range-Doppler domain and only part of the range cells are used in the calculation.
      
更多          
  fast fourier transformation
The algorithm for determining the LIS consists in obtaining, by double fast Fourier transformation, a high-resolution image filtered by selecting an appropriate combination of reflections and using this image to find the characteristic LIS.
      
The focusing of the synthetic-aperture radar is based on fast Fourier transformation providing a fast algorithm of 3D reconstruction.
      
The influence of inter-and intra-hemispheric coherence on EEG activity with eyes closed was examined using fast Fourier transformation from the 16 sampled channels.
      
The equidistant sampling allowed a direct spectral analysis using a fast Fourier transformation algorithm.
      
Cardiac BRS was measured by power spectral analysis using Fast Fourier Transformation (FFT), sequence analysis (using up, down and combined sequences) and from phase IV of the Valsalva manoeuvre.
      
更多          
  fast fourier transforms
In this paper the dielectric tapered rod antennas are rigorously analyzed using the volume integral moment method enhanced by the fast Fourier transforms (FFT's).
      
The source singularities on the original triangular meshes are then projected onto uniform rectangular grids, which enables the calculation of the resultant matrix-vector product to be performed by using the fast Fourier transforms.
      
Comparison with other Krylov-subspace iterative fast Fourier transforms methods also demonstrates the efficiency of the IRGMRES-FFT method.
      
Spectral analysis of the computed pressure oscillations are performed employing fast Fourier transforms.
      
A filtering method based on fast Fourier transforms was applied and it was possible to derive three criteria for evaluating the resulting profile.
      
更多          
  其他


点击这里查询相关文摘
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关快速傅立叶变换的内容
在知识搜索中查有关快速傅立叶变换的内容
在数字搜索中查有关快速傅立叶变换的内容
在概念知识元中查有关快速傅立叶变换的内容
在学术趋势中查有关快速傅立叶变换的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社