Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
184 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Benchmarking the Gerchberg-Saxton Algorithm (2005.08623v1)

Published 18 May 2020 in eess.IV and physics.optics

Abstract: Due to the proliferation of spatial light modulators, digital holography is finding wide-spread use in fields from augmented reality to medical imaging to additive manufacturing to lithography to optical tweezing to telecommunications. There are numerous types of SLM available with a multitude of algorithms for generating holograms. Each algorithm has limitations in terms of convergence speed, power efficiency, accuracy and data storage requirement. Here, we consider probably the most common algorithm for computer generated holography - Gerchberg-Saxton - and examine the trade-off in convergent quality, performance and efficiency. In particular, we focus on measuring and understanding the factors that control runtime and convergence.

Citations (1)

Summary

We haven't generated a summary for this paper yet.