1. Fast recurrence relation for computer-generated-hologram
- Author
-
Tomoyoshi Ito, Tomoyoshi Shimobaba, Jiantong Weng, Minoru Oikawa, and Nobuyuki Masuda
- Subjects
Discrete mathematics ,Recurrence relation ,Computation ,Graphics processing unit ,Holography ,General Physics and Astronomy ,Quantitative Biology::Genomics ,Statistics::Computation ,law.invention ,Quantitative Biology::Quantitative Methods ,symbols.namesake ,Hardware and Architecture ,law ,Taylor series ,symbols ,Trigonometric functions ,Algorithm ,Digital holography ,Mathematics - Abstract
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.
- Published
- 2012