Symmetrical iterative Fourier-transform algorithm using both phase and amplitude freedoms
Symmetrical iterative Fourier-transform algorithm using both phase and amplitude freedoms
复制标题
DOI：
10.1016/j.optcom.2006.06.060
复制
发表时间：
2006-11
影响因子：
2.4
通讯作者：
J. S. Liu;A. Caley;M. Taghizadeh
中科院分区：
文献类型：
--
作者：
J. S. Liu;A. Caley;M. Taghizadeh
提出了一种改进的Gerchberg-Saxton算法--对称迭代傅里叶变换算法，并将其应用于一系列超高斯光束整形问题和任意光束整形问题。该算法的主要特点包括：(1)利用了傅立叶域约束下的失效结果的幅值对称函数；(2)在迭代过程中同时使用了相位和幅值自由度，即保留了每次迭代在信号窗外产生的噪声。给出了在寻找振幅对称函数时确定临界常数的公式。对于所有的测试问题，新的方法都能产生高效率的解，在信号窗口中具有高精度的波束轮廓。
A modified Gerchberg–Saxton algorithm, which we call symmetrical iterative Fourier transform algorithm, is presented and employed to a series of super-Gaussian beam shaping problems and arbitrary beam shaping problems. The main features of this algorithm include (1) using an amplitude-symmetric function of the failed result about the Fourier-domain constraint; (2) using both phase and amplitude freedoms in the iteration process, i.e. the noise produced outside the signal window by each iteration is kept. A formula is given to determine a critical constant in the search for the amplitude-symmetric function. The new method results in highly efficient solutions with highly precise beam profiles in the signal window for all the test problems.