Abstract

Computer-generated holograms (CGH’s) synthesized by the iterative direct-binary-search (DBS) algorithm yield lower reconstruction error and higher diffraction efficiency than do CGH’s designed by conventional methods, but the DBS algorithm is computationally intensive. A fast algorithm for DBS is developed that recursively computes the error measure to be minimized. For complex amplitude-based error, the required computation for an L-point CGH is reduced by a factor of (L/log₂L)^1/2. The fast intensity-based algorithm is substantially more complicated, and modifications are considered in order to make the algorithm more efficient. An acceleration technique that attempts to increase the rate of convergence of the DBS algorithm is also investigated.

© 1991 Optical Society of America

Fast decimation-in-frequency direct binary search algorithms for synthesis of computer-generated holograms

J-Y. Zhuang and O. K. Ersoy
J. Opt. Soc. Am. A 11(1) 135-143 (1994)

Analysis of the leakage from computer-generated holograms synthesized by direct binary search

Brian K. Jennison and Jan P. Allebach
J. Opt. Soc. Am. A 6(2) 234-243 (1989)

Stochastic approach in the efficient design of the direct-binary-search algorithm for hologram synthesis

Bhupendra Bimal Chhetri, Shiyuan Yang, and Teruo Shimomura
Appl. Opt. 39(32) 5956-5964 (2000)

Enhanced direct binary search algorithm for binary computer-generated Fresnel holograms

Jung-Ping Liu, Chu-Qiao Yu, and Peter W. M. Tsang
Appl. Opt. 58(14) 3735-3741 (2019)

Synthesis of digital holograms by direct binary search

Michael A. Seldowitz, Jan P. Allebach, and Donald W. Sweeney
Appl. Opt. 26(14) 2788-2798 (1987)