Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Fast recurrence algorithm for computer-generated-hologram

Not Accessible

Your library or personal account may give you access

Abstract

This paper presents a fast recurrence algorithm for a computer-generated-hologram (CGH). The recurrence algorithm based on Taylor expansion can reduce the number of cosine computations in the CGH equation, and the comparison of CGHs via a conventional CGH equation and a recurrence algorithm is shown to be almost identical.

© 2011 Optical Society of America

PDF Article
More Like This
Demonstration of a fast computer generated hologram algorithm based on amplitude-phase modulation with random mask for an optical ID system

Ki-Mun Pak, Hyun-Hwan Choi, and Yong-Hyub Won
C642 Conference on Lasers and Electro-Optics/Pacific Rim (CLEO/PR) 2011

Fast wide-angle computer-generated hologram algorithm using the frequency domain

Tomasz Kozacki, Rafał Kukołowicz, Juan Martinez-Carranza, and Dominik Drąg
FW6D.4 Frontiers in Optics (FiO) 2023

Computer-generated holograms: algorithms and related topics

Tomoyoshi Shimobaba, Takashi Kakue, and Tomoyoshi Ito
DTu7B.1 Digital Holography and Three-Dimensional Imaging (DH) 2021

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All Rights Reserved