Fourier Transform and applications Univrsity of Central Florida傅立叶变换及应用中佛罗里达大学.pptVIP

Fourier Transform and Applications By Njegos Nincic Overview Transforms Mathematical Introduction Fourier Transform Time-Space Domain and Frequency Domain Discret Fourier Transform Fast Fourier Transform Applications Summary References Transforms Transform: In mathematics, a function that results when a given function is multiplied by a so-called kernel function, and the product is integrated between suitable limits. (Britannica) Can be thought of as a substitution Transforms Example of a substitution: Original equation: x + 4x2 – 8 = 0 Familiar form: ax2 + bx + c = 0 Let: y = x2 Solve for y x = ±√y Transforms Transforms are used in mathematics to solve differential equations: Original equation: Apply Laplace Transform: Take inverse Transform: y = Lˉ1(y) Fourier Transform Property of transforms: They convert a function from one domain to another with no loss of information Fourier Transform: converts a function from the time (or spatial) domain to the frequency domain Time Domain and Frequency Domain Time Domain: Tells us how properties (air pressure in a sound function, for example) change over time: Amplitude = 100 Frequency = number of cycles in one second = 200 Hz Time Domain and Frequency Domain Frequency domain: Tells us how properties (amplitudes) change over frequencies: Time Domain and Frequency Domain Example: Human ears do not hear wave-like oscilations, but constant tone Often it is easier to work in the frequency domain Time Domain and Frequency Domain In 1807, Jean Baptiste Joseph Fourier showed that any periodic signal could be represented by a series of sinusoidal functions Time Domain and Frequency Domain Fourier Transform Because of the property: Fourier Transform takes us to the frequency domain: Discrete Fourier Transform In practice, we often deal with discrete functions (digital signals, for example) Discrete version of the Fourier Transform is much more useful in computer science: O(n2) time complexity