中文说明：在数学中，离散傅里叶变换（DFT）将一个函数的等距样本的有限列表转换的复数正弦波的有限组合，排序由它们的频率，具有这些相同的样本值的系数的列表。也可以说，以采样函数从原始域（通常沿着一条线的时间或位置）到频域转换。
English Description：
In mathematics, the discrete Fourier transform (DFT) converts a finite list 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.