Fast decimation-in-frequency direct binary search algorithms for synthesis of computer-generated holograms
- 1 January 1994
- journal article
- Published by Optica Publishing Group in Journal of the Optical Society of America A
- Vol. 11 (1) , 135-143
- https://doi.org/10.1364/josaa.11.000135
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/log2 L)½Keywords
This publication has 8 references indexed in Scilit:
- Iterative interlacing error diffusion for synthesis of computer-generated hologramsApplied Optics, 1993
- Iterative interlacing approach for synthesis of computer-generated hologramsApplied Optics, 1992
- Efficient design of direct-binary-search computer-generated hologramsJournal of the Optical Society of America A, 1991
- Iterative Approaches To Computer-Generated HolographyOptical Engineering, 1989
- Optimal error diffusion for computer-generated hologramsJournal of the Optical Society of America A, 1988
- Synthesis of digital holograms by direct binary searchApplied Optics, 1987
- Computer-generated holograms with pulse-density modulationJournal of the Optical Society of America A, 1984
- Method for Computing Kinoforms that Reduces Image Reconstruction ErrorApplied Optics, 1973