Iterative Fourr Transform Algorithms provide an excellent tool for calculation of analog and quantized synthetic holograms. In principle the distributions in the object and the Fourier domain are modified to meet constraints given in both domains. In many practal situations these transformations of data belong to the class of the so called point tnuisformaticns which generally do not preserve L2 norm of data their total power or energy. It will be shown the usage of global transformations supplemented by tl ccnrvation constraint offers sorr advantages to point transformations with respect to the convergence of the algorithm. Resuitsof several numerical experiments will be given.
Martin Hajek, Martin Hajek,
"Conservative iterative Fourier-transform algorithms in digital holography", Proc. SPIE 1718, Workshop on Digital Holography, (5 January 1993); doi: 10.1117/12.138569; https://doi.org/10.1117/12.138569