动态信号处理.pptVIP

Dynamic Signal Processing动态信号处理 FFT Properties FFT特性 The Fast Fourier Transform (FFT) is an algorithm for transforming the signal from the time domain to the frequency domain. However, the signal cannot be transformed to the frequency domain in a continuous manner.It must first be sampled and digitized.This means that samples from the time domain are digitized to samples in the frequency domain, as shown in figure on next slide. Because of sampling, there is no longer an exact representation in either domain. However, a sampled representation can be closer to the ideal if the samples are placed closer together. 快速傅立叶变换(FFT)是一种将信号从时域转换到频域的运算方法。但是，信号不能以连续的方法转换到频域，必须先进行采样和数字化处理。也就是说将时域的样本通过数字化处理转换为频域的样本。请见下一张幻灯片图示。由于采样原因，两个域都不会有准确的图示。但是如果样本能放得更近一些，样本图示能更贴近理想图示。 FFTSamplesinTimeandFrequencyDomains时域与频域内的FFT 样本 Time Record时间记录 A time record is defined to be finite number of consecutive, equally-spaced samples of the input signal. Because it makes the transform algorithm simpler and much faster, the finite number of samples is restricted to a multiple of 2. 1024 intervals or equally-spaced samples equal 210 intervals。 时间记录是指连续的、间隔相等的有限数目的输入信号样本。为了使转换方法变得更加简单和迅速，样本数目限制为2的幂，如1024（2的10次方）个样本。 This digitized time record is transformed as a complete block into a complete block of frequency lines. All the samples (of the input signal) of the time record are needed to compute each and every line in the frequency domain. This does not mean a single time domain sample transforms to exactly one frequency domain line. 这一数字化的时间记录以整体的方式转换成频域的一组记录。计算频域内的每根线时需要用到时间记录的所有（输入信号）样本。但这并不是指一个时域样本转换成一个频域线。 How Many Spectral Lines Are There?有多少频谱线？ The FFT algorithm is a “complex-valued” operation; that is, it produces a “real” and an “imaginary” result, and the components of the frequency domain will appear at both positive and negative frequencies. FFT运算法则是一种“复数”运算：它会产生一个“实部”的和一个“虚部”的结果，使频域的构成部分会出现在正的和负的频率上。 Each of these components in the fr