一种基于角谱理论的改进型相位恢复迭代算法

进行星间激光通信的光学发射天线光束整形器设计时, 首要解决的问题是根据输入光场及理想的输出光场, 确定整形器的相位分布, 其核心就是相位恢复. 基于角谱传播理论, 在传统 Gerchberg-Saxton (G-S)迭代算法的基础上, 提出了一种幅度梯度加成迭代算法, 给出了算法的详细流程与分析. 与G-S相比, 新算法利用迭代过程, 构建光场幅度反馈回路, 利用梯度搜索最佳迭代路径, 两者的联合作用加速其迭代收敛进程. 数值仿真表明, 新算法的单位迭代次数所引起迭代误差下降的速度是G-S算法的1.7倍, 其收敛速度明显优于G-S算法; 对不同的随机初始相位, 新算法都能进行有效迭代, 表现出适应性强, 且收敛一致性好的优点. 幅度梯度加成迭代算法为复杂光场的高效相位恢复提供了一种新思路, 为设计各种衍射光学元件提供了技术支持. 关键词： 相位恢复 迭代算法 角谱理论 光通信

An ameliorated fast phase retrieval iterative algorithm based on the angular spectrum theory

For designing the light beam shaper in the optical transmitting antenna in inter-satellite optical communication system, the essential problem is, according to the input optical field and ideal output light field, to determine the shaper of phase distribution, in which its core is in phase recovery. Based on the traditional Gerchberg-Saxton (G-S) iterative algorithm, using the angular spectrum propagation theory, a kind of amplitude gradient addition iterative algorithm is proposed, and the detailed algorithm process and analysis are given. Compared with G-S algorithm, the new one using iterative process, constructs the light field amplitude feedback loop, and searches out the optimal iteration path using the gradient; their joint action accelerates the convergence process. Numerical simulation shows that the iterative error-drop speed caused by unit iterations in the new algorithm is 1.7 times that of the G-S algorithm, its convergence rate is obviously superior to the G-S algorithm; for different random initial phase, the new algorithm can effectively carry out iteration, show the advantages of the strong adaptability and the good convergent consistency. Amplitude gradient addition iterative algorithm gives a new effective way of recovering the complex optical field phase, and provides technical support for designing all kinds of diffraction optical element.
Keywords： phase retrieval iterative algorithm angular spectrum theory optical communication