.png){kind=icon}
.png){kind=icon}
Return
Fast recurrence relation for computer-generated-hologram
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cpc.2011.08.015.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we derive a fast recurrence relation for a computer-generated-hologram (CGH). The recurrence relation based on Taylor expansion reduces the number of cosine computations as compared with conventional CGH formula. The recurrence relation calculates a CGH 7 or 8 times faster than the conventional CGH formula on a CPU and graphics processing unit (GPU). In addition, there is almost no difference between a CGH generated by the recurrence relation and that generated by the conventional type. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.
Keywords:
Computer-generated-hologram
Diffraction
Digital holography
Graphics processing unit
Holography
Parallel computing
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.4
Papers:
1.2W
Citations:
3.7W