The Gerchberg-Saxton Phase Retrieval Algorithm and Related Variations

2020 
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.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    1
    Citations
    NaN
    KQI
    []