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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1016/j.cpc.2011.08.015 | Computer Physics Communications |
Keywords | Field | DocType |
Computer-generated-hologram,Diffraction,Digital holography,Graphics processing unit,Holography,Parallel computing | Holography,Discrete mathematics,Trigonometric functions,Digital holography,Recurrence relation,Mathematical analysis,Algorithm,Graphics processing unit,Mathematics,Taylor series,Computation | Journal |
Volume | Issue | ISSN |
183 | 1 | 0010-4655 |
Citations | PageRank | References |
2 | 0.49 | 2 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jiantong Weng | 1 | 13 | 2.23 |
Tomoyoshi Shimobaba | 2 | 37 | 14.61 |
Minoru Oikawa | 3 | 40 | 3.47 |
Nobuyuki Masuda | 4 | 18 | 6.20 |
Tomoyoshi Ito | 5 | 43 | 19.59 |