Abstract
Fast decimation-in-frequency direct binary search (DBS) algorithms for the computation of binary computer-generated holograms (CGH’s) are developed. The algorithms use the geometry of the image plane and the decimation-in-frequency property to design a fast method of scanning the hologram with the DBS method. In this way the computational complexity of the method is substantially reduced. For complex-amplitude-based error, the asymptotic computational complexity for an L-point CGH is reduced by a factor of O[(L/log2L)1/2]. For intensity-based error, the asymptotic computational complexity for an L-point CGH is reduced by a factor of O[(L log2L)1/4]. When the probability of accepting an inversion is small, an acceleration technique is also used to reduce further the time complexity.
© 1994 Optical Society of America
Full Article | PDF ArticleMore Like This
Brian K. Jennison, Jan P. Allebach, and Donald W. Sweeney
J. Opt. Soc. Am. A 8(4) 652-660 (1991)
Jie-Yao Zhuang and Okan K. Ersoy
J. Opt. Soc. Am. A 12(7) 1460-1468 (1995)
Jung-Ping Liu, Chu-Qiao Yu, and Peter W. M. Tsang
Appl. Opt. 58(14) 3735-3741 (2019)