z-logo
open-access-imgOpen Access
Fast CGH computation using S-LUT on GPU
Author(s) -
Yuechao Pan,
Xuewu Xu,
S. K. Solanki,
Xinan Liang,
Ridwan Bin Adrian Tanjung,
Tan Chiwei,
TowChong Chong
Publication year - 2009
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.17.018543
Subject(s) - computer science , lookup table , graphics processing unit , computer generated holography , computation , speedup , parallel computing , block (permutation group theory) , holography , algorithm , computer graphics (images) , computational science , optics , physics , geometry , mathematics , programming language
In computation of full-parallax computer-generated hologram (CGH), balance between speed and memory usage is always the core of algorithm development. To solve the speed problem of coherent ray trace (CRT) algorithm and memory problem of look-up table (LUT) algorithm without sacrificing reconstructed object quality, we develop a novel algorithm with split look-up tables (S-LUT) and implement it on graphics processing unit (GPU). Our results show that S-LUT on GPU has the fastest speed among all the algorithms investigated in this paper, while it still maintaining low memory usage. We also demonstrate high quality objects reconstructed from CGHs computed with S-LUT on GPU. The GPU implementation of our new algorithm may enable real-time and interactive holographic 3D display in the future.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here