网站首页  英汉词典

请输入您要查询的英文单词：

　

单词 Discrete Fourier transform
释义

Discrete Fourier transform

原声例句
Veritasium真理元素

Well, then the discrete Fourier transform will have eight frequency bins.

那么离散傅里叶变换将有八个频率仓。

Veritasium真理元素

To complete one discrete Fourier transform requires multiplying N data points by N different frequency waves.

要完成一次离散傅立叶变换，需要将 N 个数据点乘以 N 个不同频率的波。

Veritasium真理元素

Now this process works fine in principle and you could use it to calculate all discrete Fourier transforms.

现在这个过程原则上工作得很好，您可以用它来计算所有离散傅里叶变换。

中文百科

离散傅里叶变换

离散傅里叶变换（Discrete Fourier Transform，缩写为DFT），是傅里叶变换在时域和频域上都呈离散的形式，将信号的时域采样变换为其DTFT的频域采样。在形式上，变换两端（时域和频域上）的串行是有限长的，而实际上这两组串行都应当被认为是离散周期信号的主值串行。即使对有限长的离散信号作DFT，也应当将其看作其周期延拓的变换。在实际应用中通常采用快速傅里叶变换计算DFT。

英语百科

Discrete Fourier transform 离散傅里叶变换

Relationship between the (continuous) Fourier transform and the discrete Fourier transform. Left column: A continuous function (top) and its Fourier transform (bottom). Center-left column: Periodic summation of the original function (top). Fourier transform (bottom) is zero except at discrete points. The inverse transform is a sum of sinusoids called Fourier series. Center-right column: Original function is discretized (multiplied by a Dirac comb) (top). Its Fourier transform (bottom) is a periodic summation (DTFT) of the original transform. Right column: The DFT (bottom) computes discrete samples of the continuous DTFT. The inverse DFT (top) is a periodic summation of the original samples. The FFT algorithm computes one cycle of the DFT and its inverse is one cycle of the DFT inverse.
Depiction of a Fourier transform (upper left) and its periodic summation (DTFT) in the lower left corner. The spectral sequences at (a) upper right and (b) lower right are respectively computed from (a) one cycle of the periodic summation of s(t) and (b) one cycle of the periodic summation of the s(nT) sequence. The respective formulas are (a) the Fourier series integral and (b) the DFT summation. Its similarities to the original transform, S(f), and its relative computational ease are often the motivation for computing a DFT sequence.
Figure 1 : Transformée de Fourier discrète sur N = 64 points d'un sinus de fréquence 7 812,5 Hz échantillonné à 100 000 échantillons par seconde (100 kéch/s).
Berechnete 2D Fourier-Transformationen. Links Ausgangsbild, rechts Intensitätsverteilung der Fourier-Transformation.

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally spaced samples of a function into the list of coefficients of a finite combination of complex sinusoids, ordered by their frequencies, that has those same sample values. It can be said to convert the sampled function from its original domain (often time or position along a line) to the frequency domain.
随便看

　

英汉网英语在线翻译词典收录了3779314条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。

　

Copyright © 2004-2024 encnc.com All Rights Reserved
更新时间：2025/6/21 2:07:49