Open AccessEffective memory reduction of the novel look-up table with one-dimensional sub-principle fringe patterns in computer-generated holograms
Author(s) -
SeungCheol Kim,
Jae-Man Kim,
Eun-Soo Kim
Publication year - 2012
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.20.012021
Subject(s) - lookup table , computer science , holography , optics , reduction (mathematics) , massively parallel , table (database) , algorithm , parallel computing , physics , mathematics , geometry , data mining , programming language
We propose a novel approach to massively reduce the memory of the novel look-up table (N-LUT) for computer-generated holograms by employing one-dimensional (1-D) sub-principle fringe patterns (sub-PFPs). Two-dimensional (2-D) PFPs used in the conventional N-LUT method are decomposed into a pair of 1-D sub-PFPs through a trigonometric relation. Then, these 1-D sub-PFPs are pre-calculated and stored in the proposed method, which results in a remarkable reduction of the memory of the N-LUT. Experimental results reveal that the memory capacity of the LUT, N-LUT and proposed methods have been calculated to be 149.01 TB, 2.29 GB and 1.51 MB, respectively for the 3-D object having image points of 500 × 500 × 256, which means the memory of the proposed method could be reduced by 103 × 10(6) fold and 1.55 × 10(3) fold compared to those of the conventional LUT and N-LUT methods, respectively.