DAY4.5音频信号处理.pptxVIP

音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;音频信号处理;Introduction DFTs with a million points are common DFT (Discrete Fourier Transform) computational complexity O(n2) FFT (Fast Fourier Transform) computational complexity O(n log n) efficient method for computing the DFT Example For n = 220, almost 35,000 faster than DFT;Window length the length of the input data vector Transform length the length of the output, the computed DFT FFT pads or chops the input to achieve the desired transform length;Execution time of FFT depends on the transform length fastest when the transform length is a power of two almost as fast when the transform length has only small prime factors typically slower for transform lengths that are prime or have large prime factors in practice time differences，insignificant in modern FFT algorithms in Matlab， unnecessary to adjust the transform length for efficiency ;y = fft(x) window length m = length(x) transform length n = length(y) m=n y = fft(x,n) transform length is n If length(x)n, x is padded with trailing zeros to increase its length to n If length(x)n, only the first n elements of x are used to compute the transform;Fast Fourier Transform (FFT);Example-1 x: with two component frequencies of differing amplitude and phase buried in noise fs = 100; % Sample frequency (Hz) t = 0:1/fs:10-1/fs; % 10 sec sample x = (1.3)*sin(2*pi*15*t) ... % 15 Hz component + (1.7)*sin(2*pi*40*(t-2)) ... % 40 Hz component + (2.5)*randn(size(t)); % Gaussian noise m = length(x); % Window length, 1000 n = pow2(nextpow2(m)); % Transform length, 1024 % p=nextpow2(m); 2^p =abs(m) % n=pow2(p)=2^p