The design uses the fast Fu Liye transform (FFT) to calculate the para的中文翻譯

The design uses the fast Fu Liye tr

The design uses the fast Fu Liye transform (FFT) to calculate the parameters of the distribution network. Using fast Fourier transform (FFT) for harmonic analysis, the amplitude and phase of the voltage and current of each harmonic can be acquired, and then calculate the parameters of the distribution network voltage, current, power, power factor, etc.. So this chapter first introduces the contents of the fast Fu Liye transformation in the first section, and then introduces the calculation formula of the distribution network parameters based on Fu Liye transform..
2.1 fast Fourier transform
as a kind of important harmonic analysis method, fast Fourier transform is the phase angle and amplitude of the signal to be measured is the harmonic.Then according to the amplitude and phase of each harmonic is calculated on the basis of the parameters of the distribution network.
2.2.1 FFT algorithm brief
FFT, fast Fourier transform, its purpose is mainly for harmonic analysis, in order to the harmonic amplitude and phase angle. In the early time, because of the huge amount of computation of the discrete Fu Liye transform, Fu Liye transform could not be used to solve the problem in real life.. However, with the appearance of FFT algorithm, the application of Fu Liye transform becomes more and more extensive.. After many years of innovation and development, the method has been well in theory and implementation.. But in the course of the use of FFT should be noted,If the waveform contains the harmonics, the FFT transformation may produce the aliasing phenomenon and affect the accuracy of the final results.. In order to solve this problem, we must satisfy the requirement of the Nyquist sampling theorem when sampling, that is, the sampling frequency of the data is two times higher than the high harmonic frequency of the signal to be measured..
2.2.2 based on FFT harmonic analysis implement
as harmonic analysis in the application of the most widely used method, using fast Fourier transform to calculate the amplitude and phase of each harmonic, with simple operation, accurate and convenient advantages. Its concrete realization is as follows.
(1) data acquisition
before the FFT transform,It is necessary to turn analog signals into discrete digital signals, which is data acquisition.. According to the calculation of FFT, the data points collected in a period of time can meet the following conditions: M and N are positive integers..
(2) data reordering
acquisition data must be the reversal and addition calculation, the original data sequence for reordering to FFT. It is assumed that the original data sequence is {x (I) |i=0,1,2... , N-1}, the new sequence is {X (I) |i=0,1,2... N-1}, then the relationship between the two (2-1) given
0/5000
原始語言: -
目標語言: -
結果 (中文) 1: [復制]
復制成功!
本设计采用快速傅立叶变换 (FFT) 计算参数的分布网络。使用快速傅里叶变换 (FFT) 进行谐波分析的振幅和相位的电压和电流的各次谐波可以获取,然后计算参数的分布网络电压、 电流、 功率、 功率因数等。所以这一章首先介绍了快速傅立叶变换在第一节的内容,然后介绍了基于傅立叶变换的分布网络参数的计算公式...2.1 快速傅里叶变换作为一种重要的谐波分析方法,快速傅里叶变换是相角和被测信号幅值的谐波。然后根据的振幅和相位的各次谐波是根据计算参数的分布网络。2.2.1 FFT 算法简介FFT 快速傅里叶变换,其目的主要是为谐波分析、 谐波的幅值和相角的顺序。在早期的时间,因为大量的计算离散傅立叶变换,傅立叶变换可以不用于解决现实生活中存在的问题......然而,与 FFT 算法的外观,傅立叶变换的应用变得越来越广泛...经过多年的创新与发展的方法已经在理论和执行...目的在 FFT 的使用过程中应注意到,是否波形包含谐波,FFT 处理可能会产生混叠现象,因而影响最终结果的准确性......为了解决这个问题,我们必须满足奈奎斯特采样定理的要求,当采样,那就是,数据的采样频率是被测信号的高谐波频率的两倍。2.2.2 基于 FFT 谐波分析实施作为谐波分析中的应用最为广泛的方法,利用快速傅里叶变换计算的振幅和相位的各次谐波,操作简单、 准确、 方便的优点。其具体实现如下所示。(1) 数据采集之前的 FFT 变换,有必要把模拟信号变成离散的数字信号,这就是数据采集...TFF 计算,在一段时间内收集到的数据点可以满足以下条件: M 和 N 是正整数。(2) 重新排序的数据采集的数据必须逆转和加法计算,重新排序为 fft 算法的原始数据序列。它假定原始数据序列是 {x (I) |i = 0,1,2,...,N-1},新的序列是 {X (I) |i = 0,1,2......N-1},然后给两个 (2-1) 之间的关系
正在翻譯中..
結果 (中文) 3:[復制]
復制成功!
设计用the快速傅立叶变换(FFT)to calculate the parameters of the配电网。利用快速傅里叶变换(FFT)for调和分析、振幅和相位的电压和电流of each of the调和can be acquired,and then calculate the parameters of the配电网电压,电流,功率,功率因数,等。所以这章第一介绍the contents of the快速傅立叶变换in the first部分,然后介绍了计算公式of the配电网参数基于傅立叶变换。

有2.1快速傅里叶变换谐波分析方法有重要的快速傅里叶变换,相位角和幅度是to be of the信号仔细测量了is the调和。然后according to the振幅和相位计算of each调和is on the basis of the parameters of the配电网。

FFT算法简介2.2.1 FFT快速傅里叶变换,它的目的,主要是为了调和分析,in order to the谐波振幅和相位角。in the early time,because of the huge amount of the离散傅立叶变换的计算中,傅立叶变换could not be used to solve the problem in real life…然而,with the appearance of FFT算法,傅立叶变换的应用变得越来越广泛。after many years of Innovation and Development,the method has been well in Theory and Implementation…目的in the course of the use of FFT should be noted,if the波形contains the谐波,FFT变换可以产生假频the the现象和affect the accuracy of the的最终结果。为了解决这个问题,我们必须满足奈奎斯特采样定理the requirement of the当采样,that is,采样频率of the data is two时报higher than the High frequency of the谐波信号to be仔细测量了……2.2.2基于FFT谐波分析

implement你的调和分析in the Application of the most widely used方法,利用快速傅里叶变换计算的振幅和相位of each调和,以及操作简便、准确和方便的优点。其具体实现是如下。(1)

before the FFT变换的数据采集,it is necessary to turn模拟信号到数字信号的离散,which is数据采集。。according to the calculation of the data点FFT,收集in a period of time can meet the following条件:m和n是正integers…

(2)数据采集的数据重新排序must be the逆转和加法计算原始数据序列,为重新排序to FFT。它是原始数据序列是assumed that the { x(i)| i=0,1,2,……,N 1 },{ x是The New序列(I)| I = 0.12……n - 1 },then the relationship between the two(2-1)given
正在翻譯中..
 
其它語言
本翻譯工具支援: 世界語, 中文, 丹麥文, 亞塞拜然文, 亞美尼亞文, 伊博文, 俄文, 保加利亞文, 信德文, 偵測語言, 優魯巴文, 克林貢語, 克羅埃西亞文, 冰島文, 加泰羅尼亞文, 加里西亞文, 匈牙利文, 南非柯薩文, 南非祖魯文, 卡納達文, 印尼巽他文, 印尼文, 印度古哈拉地文, 印度文, 吉爾吉斯文, 哈薩克文, 喬治亞文, 土庫曼文, 土耳其文, 塔吉克文, 塞爾維亞文, 夏威夷文, 奇切瓦文, 威爾斯文, 孟加拉文, 宿霧文, 寮文, 尼泊爾文, 巴斯克文, 布爾文, 希伯來文, 希臘文, 帕施圖文, 庫德文, 弗利然文, 德文, 意第緒文, 愛沙尼亞文, 愛爾蘭文, 拉丁文, 拉脫維亞文, 挪威文, 捷克文, 斯洛伐克文, 斯洛維尼亞文, 斯瓦希里文, 旁遮普文, 日文, 歐利亞文 (奧里雅文), 毛利文, 法文, 波士尼亞文, 波斯文, 波蘭文, 泰文, 泰盧固文, 泰米爾文, 海地克里奧文, 烏克蘭文, 烏爾都文, 烏茲別克文, 爪哇文, 瑞典文, 瑟索托文, 白俄羅斯文, 盧安達文, 盧森堡文, 科西嘉文, 立陶宛文, 索馬里文, 紹納文, 維吾爾文, 緬甸文, 繁體中文, 羅馬尼亞文, 義大利文, 芬蘭文, 苗文, 英文, 荷蘭文, 菲律賓文, 葡萄牙文, 蒙古文, 薩摩亞文, 蘇格蘭的蓋爾文, 西班牙文, 豪沙文, 越南文, 錫蘭文, 阿姆哈拉文, 阿拉伯文, 阿爾巴尼亞文, 韃靼文, 韓文, 馬來文, 馬其頓文, 馬拉加斯文, 馬拉地文, 馬拉雅拉姆文, 馬耳他文, 高棉文, 等語言的翻譯.

Copyright ©2025 I Love Translation. All reserved.

E-mail: