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 language | English (US) |
---|---|
Title of host publication | Optical Holography |
Subtitle of host publication | Materials, Theory and Applications |
Publisher | Elsevier |
Pages | 61-72 |
Number of pages | 12 |
ISBN (Electronic) | 9780128154670 |
DOIs | |
State | Published - Jan 1 2019 |
Keywords
- Computer-generated holograms
- Gerchberg-Saxton
- Multiple-plane diversity
- Phase diversity
- Phase retrieval
- Polarization computer generated hologram
ASJC Scopus subject areas
- General Physics and Astronomy