Fourier, ransforms, Chap 10,12傅立叶变换，第10,12，.pptVIP

Final Notes Standard Fast Fourier Transform requires N to be a power of 2 for recursion to work Can pad the array with zeroes to extend frequency domain Can it work if N is not a power of 2? Yes, but special slower processing is needed How do we know if it works? Point N/2-1 = Point N/2+1, Point N/2-2 = Point N/2+2, Point N/2-k = Point N/2 + k, etc. Note: Points 0 and N/2 dont match, so don’t check these The FFT Inverse should restore the time domain signal Compare to the slower correlation DFT calculation Try some simple impulses and check the results Triangular (Bartlett Window) Compare: Hamming to Hanning Hanning Hamming Hanning: Faster roll of; Hamming: lower first lobe Blackman Hamming Frequency Response Comparing Windows Understanding Digital Signal Processing, Third Edition, Richard Lyons(0-13-261480-4) ? Pearson Education, 2011. Spectral Leakage using Hanning Window Understanding Digital Signal Processing, Third Edition, Richard Lyons(0-13-261480-4) ? Pearson Education, 2011. Spectral Leakage using Hamming Window Efficiency Issues Calculation of Sin(x), Cos(x), ex Sin(x) = x – x3/3! + x5/5! – x7/7! … Cos(x) = x – x2/2! + x4/4! – x6/6! … ex = x + x2/2! + x3/3! + x3/4! … Suggestions Use table look up x3 = x * x * x Consider the use of the cache when using loops Fourier Analysis The Na?ve DFT requires a double loop Outer loop is T long (length of the time domain frame) Inner loop is N long (number of FFT frequency bins) Total calculations: O(N*T), or O(N2) when N = T Fast Fourier Transform (FFT) N must be an even power of 2, if not, pad with zeros Total calculations O(N lgN) calculations Compare efficiencies N N2 lg N N lg N Improvement 128 16,384 7 896 18.2857 1,024 1,048,576 10 10,240 102.4000 8,192 67,108,864 13 106,496 630.1538 Real-time DSP Algorithms must be as efficient as possible Understanding Digital Signal Processing, Third Edition, Richard Lyons(0-13-261480-4) ? Pearson Education, 2011. Optimization of DFT Replace the double loop b