Fourier Series & The Fourier Transform What is the Fourier Transform? Fourier Cosine Series for even functions and Sine Series for odd functions The continuous.

Slides:



Advertisements
Similar presentations
Signals and Fourier Theory
Advertisements

Review of 1-D Fourier Theory:
Engineering Mathematics Class #15 Fourier Series, Integrals, and Transforms (Part 3) Sheng-Fang Huang.
Fourier Transform (Chapter 4)
Fourier Series Eng. Ahmed H. Abo absa. Slide number 2 Fourier Series & The Fourier Transform Fourier Series & The Fourier Transform What is the Fourier.
Fourier Transform – Chapter 13. Image space Cameras (regardless of wave lengths) create images in the spatial domain Pixels represent features (intensity,
Chapter Four Image Enhancement in the Frequency Domain.
Math Review with Matlab:
Aristotle University of Thessaloniki – Department of Geodesy and Surveying A. DermanisSignals and Spectral Methods in Geoinformatics A. Dermanis Signals.
3. Ultrashort Laser Pulses I
The Spectrum We define the spectrum, S(  ), of a wave E(t) to be: This is the measure of the frequencies present in a light wave.
Lecture 17 spectral analysis and power spectra. Part 1 What does a filter do to the spectrum of a time series?
The 2D Fourier Transform F (2) {f(x,y)} = F(k x,k y ) = f(x,y) exp[-i(k x x+k y y)] dx dy If f(x,y) = f x (x) f y (y), then the 2D FT splits into two 1D.
Image Enhancement in the Frequency Domain Part I Image Enhancement in the Frequency Domain Part I Dr. Samir H. Abdul-Jauwad Electrical Engineering Department.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communication Systems ECE Spring 2009 Shreekanth Mandayam ECE Department Rowan University.
Deconstructing periodic driving voltages (or any functions) into their sinusoidal components: It's easy to build a periodic functions by choosing coefficients.
Fourier Series. is the “fundamental frequency” Fourier Series is the “fundamental frequency”
Feb. 7, 2011 Plane EM Waves The Radiation Spectrum: Fourier Transforms.
The Fourier Transform The Dirac delta function Some FT examples exp(i  0 t) cos(  0 t) Some Fourier Transform theorems Complex conjugate: f*(t) Shift:
Fourier Transformation
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Chapter 4 Image Enhancement in the Frequency Domain Chapter.
1 Week 4 1. Fourier series: the definition and basics (continued) Fourier series can be written in a complex form. For 2π -periodic function, for example,
Lecture 12 Convolutions and summary of course Remember Phils Problems and your notes = everything Today Convolutions.
Function approximation: Fourier, Chebyshev, Lagrange
Integral Transform Dongsup Kim Department of Biosystems, KAIST Fall, 2004.
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
1 Review of Fourier series Let S P be the space of all continuous periodic functions of a period P. We’ll also define an inner (scalar) product by where.
Image Processing Fourier Transform 1D Efficient Data Representation Discrete Fourier Transform - 1D Continuous Fourier Transform - 1D Examples.
Chapter 7 Fourier Series (Fourier 급수)
2. Waves, the Wave Equation, and Phase Velocity What is a wave? Forward [ f(x-vt) ] and backward [ f(x+vt) ] propagating waves The one-dimensional wave.
Fourier Transforms Section Kamen and Heck.
Fourier Series Summary (From Salivahanan et al, 2002)
Outline  Fourier transforms (FT)  Forward and inverse  Discrete (DFT)  Fourier series  Properties of FT:  Symmetry and reciprocity  Scaling in time.
Image Processing © 2002 R. C. Gonzalez & R. E. Woods Lecture 4 Image Enhancement in the Frequency Domain Lecture 4 Image Enhancement.
Fourier theory We know a lot about waves at a single  : n( , v p ( , R(  absorption(  … Analyze arbitrary in terms of these, because Fourier.
Module 2 SPECTRAL ANALYSIS OF COMMUNICATION SIGNAL.
Lecture 9 Fourier Transforms Remember homework 1 for submission 31/10/08 Remember Phils Problems and your notes.
Lecture 10 Fourier Transforms Remember homework 1 for submission 31/10/08 Remember Phils Problems and your notes.
Fourier Series. Introduction Decompose a periodic input signal into primitive periodic components. A periodic sequence T2T3T t f(t)f(t)
Announcements 10/20/10 Prayer Term project proposals due on Saturday night! to me: proposal in body of , 650 word max. See website for guidelines,
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
Digital Image Processing, 2nd ed. © 2002 R. C. Gonzalez & R. E. Woods Background Any function that periodically repeats itself.
ENG4BF3 Medical Image Processing Image Enhancement in Frequency Domain.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
Waves, the Wave Equation, and Phase Velocity What is a wave? Forward [ f(x-vt) ] and backward [ f(x+vt) ] propagating waves The one-dimensional wave equation.
Periodic driving forces
Chapter 2. Signals and Linear Systems
Astronomical Data Analysis I
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Ultrashort Laser Pulses I Description of pulses Intensity and phase The instantaneous frequency and group delay Zero th and first-order phase The linearly.
Fourier series, Discrete Time Fourier Transform and Characteristic functions.
INTRODUCTION TO SIGNALS
Copyright © Cengage Learning. All rights reserved. 16 Vector Calculus.
 Introduction to reciprocal space
Fourier Transform and Spectra
The Fourier Transform.
Math for CS Fourier Transforms
Math for CS Fourier Transform
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Fourier Series & The Fourier Transform What is the Fourier Transform? Anharmonic Waves Fourier Cosine Series for even functions Fourier Sine Series for.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
The Fourier Transform What is the Fourier transform?
Fourier Series & The Fourier Transform
Image Enhancement in the
UNIT II Analysis of Continuous Time signal
ENG4BF3 Medical Image Processing
Fourier Series & The Fourier Transform
Fourier transforms and
The Fourier Transform Some Fourier Transform theorems Scale: f(at )
Convolution and Autocorrelation
Presentation transcript:

Fourier Series & The Fourier Transform What is the Fourier Transform? Fourier Cosine Series for even functions and Sine Series for odd functions The continuous limit: the Fourier transform (and its inverse) The spectrum Some examples and theorems Prof. Rick Trebino, Georgia Tech

What do we hope to achieve with the Fourier Transform? We desire a measure of the frequencies present in a wave. This will lead to a definition of the term, the spectrum. Plane waves have only one frequency, . This light wave has many frequencies. And the frequency increases in time (from red to blue). It will be nice if our measure also tells us when each frequency occurs. Light electric field Time

Lord Kelvin on Fourier’s theorem Fourier’s theorem is not only one of the most beautiful results of modern analysis, but it may be said to furnish an indispensable instrument in the treatment of nearly every recondite question in modern physics. Lord Kelvin

Joseph Fourier Fourier was obsessed with the physics of heat and developed the Fourier series and transform to model heat-flow problems. Joseph Fourier

Anharmonic waves are sums of sinusoids. Consider the sum of two sine waves (i.e., harmonic waves) of different frequencies: The resulting wave is periodic, but not harmonic. Essentially all waves are anharmonic.

Fourier decomposing functions Here, we write a square wave as a sum of sine waves. sin(  t) sin(3  t) sin(5  t)

Any function can be written as the sum of an even and an odd function. E(-x) = E(x) O(-x) = -O(x)

Fourier Cosine Series Because cos(mt) is an even function (for all m ), we can write an even function, f(t), as: where the set { F m ; m = 0, 1, … } is a set of coefficients that define the series. And where we’ll only worry about the function f(t) over the interval (–π,π).

The Kronecker delta function

Finding the coefficients, F m, in a Fourier Cosine Series Fourier Cosine Series: To find F m, multiply each side by cos(m ’ t), where m ’ is another integer, and integrate: But: So:  only the m ’ = m term contributes Dropping the ’ from the m :  yields the coefficients for any f(t) !

Fourier Sine Series Because sin(mt) is an odd function (for all m ), we can write any odd function, f(t), as: where the set { F ’ m ; m = 0, 1, … } is a set of coefficients that define the series. where we’ll only worry about the function f(t) over the interval (– π,π).

Finding the coefficients, F ’ m, in a Fourier Sine Series Fourier Sine Series: To find F m, multiply each side by sin(m ’ t), where m ’ is another integer, and integrate: But: So:  only the m ’ = m term contributes Dropping the ’ from the m :  yields the coefficients for any f(t) !

Fourier Series even component odd component where and So if f(t) is a general function, neither even nor odd, it can be written:

We can plot the coefficients of a Fourier Series We really need two such plots, one for the cosine series and another for the sine series. F m vs. m m

Discrete Fourier Series vs. Continuous Fourier Transform F m vs. m m Again, we really need two such plots, one for the cosine series and another for the sine series. Let the integer m become a real number and let the coefficients, F m, become a function F(m). F(m)F(m)

The Fourier Transform Consider the Fourier coefficients. Let’s define a function F(m) that incorporates both cosine and sine series coefficients, with the sine series distinguished by making it the imaginary component: Let’s now allow f(t) to range from –  to  so we’ll have to integrate from –  to , and let’s redefine m to be the “frequency,” which we’ll now call  : F(  ) is called the Fourier Transform of f(t). It contains equivalent information to that in f(t). We say that f(t) lives in the time domain, and F(  ) lives in the frequency domain. F(  ) is just another way of looking at a function or wave. F(m)  F m – i F ’ m = The Fourier Transform

The Inverse Fourier Transform The Fourier Transform takes us from f(t) to F (  ). How about going back? Recall our formula for the Fourier Series of f(t) : Now transform the sums to integrals from –  to , and again replace F m with F(  ). Remembering the fact that we introduced a factor of i (and including a factor of 2 that just crops up), we have: Inverse Fourier Transform

The Fourier Transform and its Inverse The Fourier Transform and its Inverse: So we can transform to the frequency domain and back. Interestingly, these transformations are very similar. There are different definitions of these transforms. The 2π can occur in several places, but the idea is generally the same. Inverse Fourier Transform FourierTransform

There are several ways to denote the Fourier transform of a function. If the function is labeled by a lower-case letter, such as f, we can write: f(t)  F(  ) If the function is already labeled by an upper-case letter, such as E, we can write: or: Fourier Transform Notation ∩ Sometimes, this symbol is used instead of the arrow:

The Spectrum We define the spectrum, S(  ), of a wave E(t) to be: This is the measure of the frequencies present in a light wave.

Example: the Fourier Transform of a rectangle function: rect(t) Imaginary Component = 0 F()F() 

Example: the Fourier Transform of a Gaussian, exp(-at 2 ), is itself! t 0  0 The details are a HW problem! ∩

The Dirac delta function Unlike the Kronecker delta-function, which is a function of two integers, the Dirac delta function is a function of a real variable, t. t (t)(t)

The Dirac delta function It’s best to think of the delta function as the limit of a series of peaked continuous functions. t f1(t)f1(t) f2(t)f2(t) f m (t) = m exp[-(mt) 2 ]/√  f3(t)f3(t) (t)(t)

Dirac  function Properties t (t)(t)

  (  ) The Fourier Transform of  (t) is 1. And the Fourier Transform of 1 is  (  ): t (t)(t)   t  0 0

The Fourier transform of exp(i  0 t) The function exp(i  0 t) is the essential component of Fourier analysis. It is a pure frequency. F {exp(i  0 t)}    exp(i  0 t)  t t Re Im 

The Fourier transform of cos(   t)      cos(  0 t) t 

Fourier Transform Symmetry Properties Expanding the Fourier transform of a function, f(t) :  Re{F(  )}  Im{F(  )}   = 0 if Re{f(t)} is odd = 0 if Im{f(t)} is even Even functions of  Odd functions of  = 0 if Im{f(t)} is odd = 0 if Re{f(t)} is even  Expanding more, noting that: if O(t) is an odd function

The Modulation Theorem: The Fourier Transform of E(t) cos(  0 t )  00  -0-0 E ( t ) = exp(-t 2 ) t Example:

Scale Theorem The Fourier transform of a scaled function, f(at) : If a < 0, the limits flip when we change variables, introducing a minus sign, hence the absolute value. Assuming a > 0, change variables: u = at Proof:

The Scale Theorem in action f(t)f(t) F()F() Short pulse Medium- length pulse Long pulse The shorter the pulse, the broader the spectrum! This is the essence of the Uncertainty Principle!  ttt

The Fourier Transform of a sum of two functions Also, constants factor out. f(t)f(t) g(t)g(t) t t t    F()F() G()G() f(t)+g(t) F(  ) + G(  )

Shift Theorem

Fourier Transform with respect to space F {f(x)} = F(k) If f(x) is a function of position, We refer to k as the spatial frequency. Everything we’ve said about Fourier transforms between the t and  domains also applies to the x and k domains. k x

The 2D Fourier Transform F (2) {f(x,y)} = F(k x,k y ) = f(x,y) exp[-i(k x x+k y y)] dx dy If f(x,y) = f x (x) f y (y), then the 2D FT splits into two 1D FT's. But this doesn’t always happen. F (2) {f(x,y)} x y f(x,y)

The Pulse Width There are many definitions of the "width" or “length” of a wave or pulse. The effective width is the width of a rectangle whose height and area are the same as those of the pulse. Effective width ≡ Area / height: Advantage: It’s easy to understand. Disadvantages: The Abs value is inconvenient. We must integrate to ± ∞. t f(0) 0  t eff t tt (Abs value is unnecessary for intensity.)

The Uncertainty Principle The Uncertainty Principle says that the product of a function's widths in the time domain (  t ) and the frequency domain (  ) has a minimum. (Different definitions of the widths and the Fourier Transform yield different constants.) Combining results: or: Define the widths assuming f(t) and F(  ) peak at 0 :