助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   快速傅立叶变换(fft) 的翻译结果: 查询用时:0.029秒
图标索引 在分类学科中查询
所有学科
电信技术
计算机软件及计算机应用
无线电电子学
自动化技术
数学
力学
心血管系统疾病
更多类别查询

图标索引 历史查询
 

快速傅立叶变换fft
相关语句
  “快速傅立叶变换(fft)”译为未确定词的双语例句
     Accomplishment of Fast Fourier Transform in TMS320F206
     快速傅立叶变换(FFT)在TMS320F206上的实现
短句来源
     FFT Processor Design Based on FPGA
     基于FPGA的快速傅立叶变换(FFT)处理器的设计
短句来源
     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)相结合 ,提出了一种新的语音信号的基音频率检测方法。
短句来源
     One is the fast Fourier transform (FFT) accelerated algorithm.
     一种是快速傅立叶变换(FFT)加速算法。
短句来源
     Fast Fourier Transform (FFT) is inevitable to cause the spectrum leakage and fence effect because of truncation and discreteness in signal collection.
     采用快速傅立叶变换(FFT)进行电力系统谐波分析时,需要对采样信号截断并离散化,从而导致频谱泄漏和栅栏效应。
短句来源
更多       
  相似匹配句对
     Accomplishment of Fast Fourier Transform in TMS320F206
     快速傅立叶变换(FFT)在TMS320F206上的实现
短句来源
     One is the fast Fourier transform (FFT) accelerated algorithm.
     一种是快速傅立叶变换(FFT)加速算法。
短句来源
     The Fast W Transform
     快速W变换
短句来源
     FFT Processor Design Based on FPGA
     基于FPGA的快速傅立叶变换(FFT)处理器的设计
短句来源
     Outline of Fast Fourier Transform Algorithm
     快速傅立叶变换算法概述
短句来源
查询“快速傅立叶变换(fft)”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  fast fourier transform (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).
      
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).
      
This makes it possible to study them by means of analysis of multiplicative phenomena using the Fast Fourier Transform (FFT).
      
Impedance matrix elements are computed by using fast Fourier transform(FFT), and reduced equation is solved by using diakoptic technique.
      
更多          
  the fast fourier transform (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).
      
This makes it possible to study them by means of analysis of multiplicative phenomena using the Fast Fourier Transform (FFT).
      
Based on the fast fourier transform (FFT), the fluorescence lifetime is obtained from the tangent function of the phase angle of the first non-zeroth item of FFT result.
      
Then, the integrals in the mode decomposition of the incident field are replaced by the fast Fourier transform (FFT), thus the decomposition coefficients of all modes on a given annulus can be fast and easily obtained through one FFT.
      
The method transfers the computation of WVD into real field from complex field to remove the redundancies in the fast Fourier transform(FFT) computation.
      
更多          


Convolution filter is a method commonly used in seismic data processing. Because of the vast amount of seismic data and the long convolution filter factors, some difficulties might be brought up as the convolution calculation is carrying out in time domain. Right after the appearence of the Fast Fourier Transformation (FFT) , was the convolution calculation run from time domain to frequency domain. This is the so called"Fast Convolution Filter". The way of doing the calculation is, to speak in concrete terms,...

Convolution filter is a method commonly used in seismic data processing. Because of the vast amount of seismic data and the long convolution filter factors, some difficulties might be brought up as the convolution calculation is carrying out in time domain. Right after the appearence of the Fast Fourier Transformation (FFT) , was the convolution calculation run from time domain to frequency domain. This is the so called"Fast Convolution Filter". The way of doing the calculation is, to speak in concrete terms, to carry out the FFT for the seismic data x(t) and the filter factor h(t) respectively for the purpose of changing them into the seismic frequency spectrum X(f) and the frequency spectrum of filter factor H(f), to multiply X(f) by H(f), then, carrying out the inverse transformation of FFT for the product, the convolution calculation thus accomplished.

褶积滤波是地震资料处理中的常用方法,但由于地震数据的数量一般较大,而褶积滤波因子通常又较长,这就给在时间域进行褶积运算带来一定的困难。快速傅立叶变换(FFT)出现之后,人们就把褶积运算从时间域搬到频率域进行,这就是所谓的“快速褶积滤波”(快速相关亦然)。在这个运算过程中所进行的正向和反向傅立叶变换,实质上是一系列包括三角函数在内的复数运算。由于复数运算比实数运算复杂,又需要存放三角函数的地方,并存在舍入误差等不足。因此,近年来在国外和国内一些部门,针对FFT存在的不足之处,开展了所谓“数论变换”的研究,取得了一定的成效。 本文首先简要地介绍一下“数论变换”,然后用数论变换方法,对地震数据进行快速褶积滤波作初步的探索,最后对结果提出了一些看法。

During the recent years, the information science has been developing by leaps and bounds. One problem of importace to improve the speed of processing. As is well known, the essential tool is the method of FFT. In this paper, an ingenious and time-saving hardware implementation of FFT is recommended. Orders of magnitude of speed improvement is achieved. Fundamental principle, equations of transformation and, in particular, the circuit configuration and the time of transformation are discussed in detail.Also,...

During the recent years, the information science has been developing by leaps and bounds. One problem of importace to improve the speed of processing. As is well known, the essential tool is the method of FFT. In this paper, an ingenious and time-saving hardware implementation of FFT is recommended. Orders of magnitude of speed improvement is achieved. Fundamental principle, equations of transformation and, in particular, the circuit configuration and the time of transformation are discussed in detail.Also, the application of the multiplication accumulator is discussed.lt is a multiplication arithmetic unit capable cf performing 12×12 multiplication as well as product accumulation.It has an additional feature of permiting the accumulator contents to be subtracted from the next product instead of being added, if desired.Input registers are provided in additon to the product accumulation register. The multiplication accumulator is the central part of the FFTs.

本文从快速傅立叶变换(FFT)出发,介绍一种变换速度更高的快速傅立叶变换新方法,并对一种小型快速傅立叶变换器的基本原理、变换方程式、特别是电路结构和变换时间等问题进行了讨论。

This paper describes three digital filtering methods for processing indicator diagrams of internal combustion engines based on the theory of digital signal processing to replace the commonly used diagram smoothing methods.

本文发展了二种基于数字信号处理理论的数字滤波法,用来对内燃机示功图进行处理以替代目前常用的“光顺”方法。根据用同态信号处理原理对发动机示功图及通道效应的频率特征进行的分析,本文得出了三种失真微小的频域数字滤波法:复合带阻滤波法(CBRF)、广义频率抽样滤波法(GFSF),逆滤波加选频滤波法(IARF)。这些基于示功图频谱分析的方法,具有简单的很容易确定的滤波器参数。为评定和改进数字滤波方法(本文用实验加数值仿真的闭环方法),在三台压燃式发动机上对上述方法进行了评定。结果证明滤波法能有效地把干扰与有用信号分离,并能将周期性强干扰从周期性信号中滤除。利用本文的方法,具有短测压通道的而不是平齐安装的传感器将可更精确地测量缸内压力,因为这时热冲击效应实际上可以忽略,而通道效应则可用数字滤波法滤除。此外本文还提出了三种示功图处理中的快速傅立叶变换(FFT)的预处理方法。

 
<< 更多相关文摘    
图标索引 相关查询

 


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

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