Convolution, Fourier Series, and the Fourier Transform卷积，傅立叶级数，与傅立叶变换.pptVIP

Convolution A mathematical operator which computes the pointwise overlap between two functions. Discrete domain: Continuous domain: Discrete domain Basic steps Flip (reverse) one of the functions. Shift it along the time axis by one sample. Pointwise multiply the corresponding values of the two digital functions. Sum the products from step 3 to get one point of the digital convolution. Repeat steps 1-4 to obtain the digital convolution at all times that the functions overlap. Continuous domain example Continuous domain example LTI (Linear Time-Invariant) Systems Convolution can describe the effect of an LTI system on a signal Assume we have an LTI system H, and its impulse response h[n] Then if the input signal is x[n], the output signal is y[n] = x[n] * h[n] Fourier Series Most periodic functions can be expressed as a (infinite) linear combination of sines and cosines F(t) = a0 + a1cos (ωt) + b1sin(ωt) + a2cos (2ωt) + b2sin(2ωt) + … = F(t) is a periodic function with Most Functions? F(t) is a periodic function with must satisfy certain other conditions: finite number of discontinuities within T finite average within T finite number of minima and maxima Calculate Coefficients Example F(t) = square wave, with T=1.0s ( ) Example Example Why Frequency Domain? Allows efficient representation of a good approximation to the original function Makes filtering easy And a whole host of other reasons…. But One Really Important One Note that convolution in the time domain is equivalent to multiplication in the frequency domain (and vice versa)! Fourier Family Fourier Transform Definitions: Can be difficult to compute = Often rely upon table of transforms Delta function Definition: Often, the result of the Fourier Transform needs to be expressed in terms of the delta function Fourier Transform pairs ? ?