论文标题
基准测试Gerchberg-Saxton算法
Benchmarking the Gerchberg-Saxton Algorithm
论文作者
论文摘要
由于空间光调节器的扩散，数字全息图在从增强现实到医学成像到添加剂到光刻到光刻到光学镊子到电信到电信的领域中广泛使用。有多种类型的SLM，以及用于生成全息图的多种算法。每种算法在收敛速度，功率效率，准确性和数据存储要求方面都有局限性。 在这里，我们认为可能是计算机生成的全息图的最常见算法-Gerchberg -saxton-并检查收敛质量，性能和效率方面的权衡。特别是，我们专注于衡量和理解控制运行时和收敛的因素。
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.
