The gerchberg-saxton phase retrieval algorithm and related variations

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

This chapter provides a short introduction to the classical Gerchberg-Saxton algorithm and an argument for its convergence. Several interesting variations of the algorithm are presented that are designed for faster and more reliable convergence, reduction of speckle noise, projection of arbitrary polarization state distributions, useful broad-wavelength applications, and multiple-plane diversity.

Original languageEnglish (US)
Title of host publicationOptical Holography
Subtitle of host publicationMaterials, Theory and Applications
PublisherElsevier
Pages61-72
Number of pages12
ISBN (Electronic)9780128154670
DOIs
StatePublished - Jan 1 2019

Keywords

  • Computer-generated holograms
  • Gerchberg-Saxton
  • Multiple-plane diversity
  • Phase diversity
  • Phase retrieval
  • Polarization computer generated hologram

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'The gerchberg-saxton phase retrieval algorithm and related variations'. Together they form a unique fingerprint.

  • Cite this

    Milster, T. D. (2019). The gerchberg-saxton phase retrieval algorithm and related variations. In Optical Holography: Materials, Theory and Applications (pp. 61-72). Elsevier. https://doi.org/10.1016/B978-0-12-815467-0.00003-7