1 / 25

11.2 Fourier transforms 11.2.1 One-dimensional transforms

Chapter 11 Fourier optics. April 24 Fourier transform. 11.2 Fourier transforms 11.2.1 One-dimensional transforms. Real representation :. Complex exponential representation :. In time domain:.  Fourier transform   Inverse Fourier transform . Other alternative forms exist. Proof:.

royce
Download Presentation

11.2 Fourier transforms 11.2.1 One-dimensional transforms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Chapter 11 Fourier optics April 24 Fourier transform 11.2 Fourier transforms 11.2.1 One-dimensional transforms Real representation: Complex exponential representation: In time domain: Fourier transform Inverse Fourier transform Other alternative forms exist.

  2. Proof:

  3. Example:Fourier transform of the Gaussian function 1) The Fourier transform of a Gaussian function is again a Gaussian function. 2) Standard deviations (f (x) drops to e-1/2):

  4. 11.2.2 Two-dimensional transforms Example:Fourier transform of the cylinder function x a y

  5. J0(u) J1(u) u

  6. Read: Ch11: 1-2 Homework: Ch11: 2,3 Due: May 3

  7. d (x) 1 x 0 d (x- x0) 1 x x0 0 April 26 Dirac delta function 11. 2.3 The Dirac delta function Dirac delta function: A sharp distribution function that satisfies: A way to show delta function Sifting property of the Dirac delta function: If we shift the origin, then

  8. Delta sequence: A sequence that approaches the delta function when the distribution is narrow. The 2D delta function: The Fourier representation of delta function:

  9. Displacement and phase shift: The Fourier transform of a function displaced in space is the transform of the undisplaced function multiplied by a linear phase factor. Proof:

  10. Fourier transform of some functions: (constants, delta functions, combs, sines and cosines): f(x) F(k) f(x) F(k) 1 2p … x k x k 0 0 0 0 f(x) F(k) f(x) F(k) 1 1 … x k x 0 0 k 0 0

  11. A(k) f(x) k x 0 f(x) B(k) k x 0 f(x) A(k) x k 0 f(x) B(k) k x 0

  12. Read: Ch11: 2 Homework: Ch11: 4,7,8,9,14 Due: May 3

  13. Z z Ii(Y,Z) I0(y,z) Y y April 29, May 1 Convolution theorem 11.3 Optical applications 11.3.1 Linear systems Linear system: Suppose object f (y, z) passing through an optical system results in image g(Y, Z), the system is linear if 1) af (y, z) ag(Y, Z), 2) af1(y, z) + bf2(y, z)  ag1(Y, Z) + bg2(Y, Z). Considering the case 1) incoherent light, and 2) MT = +1. The flux density arriving at the image point (Y, Z) from dydz is Point-spread function

  14. z Z Ii(Y,Z) I0(y,z) y Y z Z I0(y,z) Ii(Y,Z) y Y Example: • The point-spread functionis the irradiance produced by the system with an input point source. In the diffraction-limited case with no aberration, the point-spread function is the Airy distribution function. • The image is the superposition of the point-spread function, weighted by the source radiant fluxes.

  15. Space invariance: Shifting the object will only cause the shift of the image:

  16. f(x) x h(x) x h(X-x) x X f(x)h(x) X 11.3.2 The convolution integral Convolution integral: The convolution integral of two functionsf (x) and h(x) is Symbol: g(X) = f(x)h(x) Example 1: The convolution of a triangular function and a narrow Gaussian function.

  17. f(x) x h(x) x h(X-x) x X f(x)h(x) X Example 2: The convolution of two square functions. The convolution theorem: Proof: Example:f (x) and h(x) are square functions.

  18. Frequency convolution theorem: Please prove it. Example: Transform of a Gaussian wave packet. Transfer functions: Optical transfer functionT (OTF) Modulation transfer functionM (MTF) Phase transfer functionF (PTF)

  19. Read: Ch11: 3 Homework: Ch11: 15,19,20,21,22,26,27 Due: May 8

  20. Y y Z P(Y,Z) r dydz R Y x X z Z May 3 Fourier methods in diffraction theory 11.3.3 Fourier methods in diffraction theory Fraunhofer diffraction: Aperture function: The field distribution over the aperture: A(y, z) = A0(y, z) exp[if (y, z)] • Each image point corresponds to a spatial frequency. • The field distribution of the Fraunhofer diffraction pattern is the Fourier transform of the aperture function:

  21. A(z) E(kZ) z kZ b/2 -b/2 2p/b The single slit: Rectangular aperture: Fraunhofer: The light interferes destructively here. Fourier: The source has no spatial frequency here. The double slit (with finite width): f(z) h(z) g(z)  = z z z b/2 -b/2 a/2 -a/2 a/2 -a/2 F(kZ) H(kZ) G(kZ) × = kZ kZ kZ

  22. F(kZ) kZ Three slits: |F(kZ)|2 F(kZ) f(z) kZ kZ z 0 a -a • Apodization: Removing the secondary maximum of a diffraction pattern. • Rectangular aperture  sinc function  secondary maxima. • Circular aperture  Bessel function (Airy pattern)  secondary maxima. • Gaussian aperture  Gaussian function  no secondary maxima. f(z) z

  23. Array theorem: The Fraunhofer diffraction pattern from an array of identical apertures = The Fourier transform of an individual aperture × The Fourier transform of a set of point sources arrayed in the same manner. Convolution theorem z z  = y y y Example: The double slit (with finite width).

  24. Read: Ch11: 3 Homework: Ch11: 29,30,32 Due: May 8

  25. “You can’t judge a book by its cover.”

More Related