低散斑环形光束整形器件的设计及实验

提出一种可有效抑制散斑噪声的衍射元件设计方法.在传统Gerchberg-Saxton算法的基础上,通过选择一种特殊的初始相位,在不降低衍射效率的同时,有效提升光斑的均匀性.以将高斯光束整形成环形平顶光束为例,开展了数值仿真和光学实验.结果表明,利用该方法和传统Gerchberg-Saxton算法设计得到的环形平顶光束散斑对比度分别为11%和34%,验证了该方法可以获得低散斑噪声的环形平顶光束.     

一种用于减少相位突变点的衍射光学元件改进设计方法

提出了一种基于数字图像处理技术的用于降低相位突变点的改进型Gerchbery-Saxton(G-S)衍射光学元件设计方法。与普通的G-S衍射光学元件设计算法相比,这种改进型的G-S算法能够使得衍射光学元件的相位分布曲线更加光滑,并且在迭代计算过程中具有更强的收敛能力。利用该种算法获得了由高斯光束变换成空心光束时所需要的衍射光学元件的相位分布,在同样参数条件下,均方根误差为8.31%,优于普通G-S算法的9.46%;并且约有33.2%的像素的相位值得到了改进,从而平滑了衍射光学元件的相位分布曲线,便于实际的微加工。     

基于环形光束整形的衍射光学元件的精确设计

提出一种改进的Gerchberg-Saxton(G-S)算法,实现了基于环形光束的衍射光学元件的精确设计。所提算法可以确保输出平面上有小的采样间隔,起到了抑制散斑的作用;与未采用散斑抑制的常规的改进G-S算法相比,所提算法得到了更高性能的均匀光斑;仿真结果和实验结果一致。     

一种用于光束整形的衍射光学元件设计算法

在光束整形衍射光学元件的设计中,为同时减小输出光束的均方根误差和顶部不均匀度值,提出了模糊控制迭代算法(IAFC)。在盖师贝格-撒克斯通(Gerchberg-Saxton,G-S)算法的基础上,提出了平滑修正法,可有效改善输出光束的顶部均匀度,但却增大了均方根误差值。模糊控制迭代算法依据模糊控制理论,通过有效结合盖师贝格-撒克斯通算法和平滑修正法来同时降低均方根误差和顶部不均匀度值。计算机设计的结果表明,利用模糊控制迭代算法可以得到非常理想的输出光束,其均方根误差和顶部不均匀度值分别为0.75%和0.46%,能量转换效率可达94.91%。为光束整形衍射光学元件的设计提供了一种有效的新算法。     

用于共孔径相干合成的衍射光学元件设计

分析了衍射光学元件实现共孔径相干合成的物理过程,建立了基于衍射光学元件的共孔径相干合成数学模型,推导了合成光束复振幅与入射光束和衍射光学元件相位分布之间的关系。提出用合成光束强度分布的均匀性作为评价函数的优化方法,获得了一维衍射合束器的相位分布。与文献报道的衍射光学元件分束器相比,可获得更高的合成效率。采用模拟退火算法结合随机并行梯度下降算法优化合束器设计,提高了计算效率,获得了多束衍射合束器的相位分布和合成效率。分析了单子束失效及合束器像差对合成效率的影响,结果表明:随着合束数量的增加,单子束失效对合成效率的影响逐渐减小;若使合成效率退化小于5%,衍射光学元件的波像差均方根值应控制在λ/28以内。     

用于光束整形的衍射光学元件设计的混合算法

提出了一种用于衍射光学元件优化设计的混合遗传迭代爬山算法,该算法将迭代量化傅里叶变换算法融入到遗传算法中,然后在整体遗传算法结束后,对找到的当前最优解再用爬山法进行局部寻优,从而得到最优的衍射光学元件表面相位分布.用该混合方法设计了衍射光学元件,可以将入射的高斯光束整形成方形的均匀光斑.模拟结果表明:该混合算法具有收敛速度快、设计准确度高等优点.相比于其它设计方法,本文提出的方法能较好地改善整形效果,特别适用于光束整形的衍射元件设计.     

用于光束整形的衍射光学元件设计的混合算法

提出了一种用于衍射光学元件优化设计的混合遗传迭代爬山算法,该算法将迭代量化傅里叶变换算法融入到遗传算法中,然后在整体遗传算法结束后,对找到的当前最优解再用爬山法进行局部寻优,从而得到最优的衍射光学元件表面相位分布.用该混合方法设计了衍射光学元件,可以将入射的高斯光束整形成方形的均匀光斑.模拟结果表明:该混合算法具有收敛速度快、设计准确度高等优点.相比于其它设计方法,本文提出的方法能较好地改善整形效果,特别适用于光束整形的衍射元件设计.     

利用汉克尔变换设计高斯光束整形衍射元件的应用研究

衍射光学元件由于可以实现对高斯光束的整形而被重视,其通常的设计方法为G-S算法,由于使用傅里叶变换运算量大、费时长,将快速汉克尔变换应用到这些算法中可以极大地提高运算速度,节省运算时间,为设计复杂的光束整形元件提供了高效、可行的方法。本文利用该种方法设计针对中心波长为775 nm、光束束腰口径为6 cm的激光器,成功设计了一个具有二阶相位的折衍混合光学元件。仅单独这一片元件,既可在距离其35 m处得到一半径为200μm的圆形平顶光斑,均方根误差D0.021。当抽样值取2~15时,在普通PC机上运行时间仅为20.05 s,大大节省了优化设计时间(整个优化设计过程往往需要几十次甚是上百次这种运算)。同时利用离子刻蚀技术加工了该折衍混合元件,并进行了实际测试,结果与设计值基本相符,整形效果较好。这种单片的整形元件不仅整形效果好,还有利于与激光器的集成,简化系统的调节。     

电寻址空间光调制器“黑栅”效应的消除方法

提出了两种消除电寻址空间光调制器由于低开口率所引起的"黑栅"效应的方法:利用衍射微透镜阵列的方法和利用纯相位型光束整形器件阵列的方法.分析了这两种方法的基本原理,给出了微透镜阵列和光束整形器件阵列的设计思想,并比较了这两种方法的异同点.采用杨一顾相位恢复算法得到了光束整形结果.理论分析及仿真计算表明:这种方法均能有效地消除电寻址空间光调制器相邻象素之间的黑带.     

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

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

Application of optical diffraction method in designing phase plates

Continuous phase plate(CPP),which has a function of beam shaping in laser systems,is one kind of important diffractive optics.Based on the Fourier transform of the Gerchberg-Saxton(G-S) algorithm for designing CPP,we proposed an optical diffraction method according to the real system conditions.A thin lens can complete the Fourier transform of the input signal and the inverse propagation of light can be implemented in a program.Using both of the two functions can realize the iteration process to calculate the near-field distribution of light and the far-field repeatedly,which is similar to the G-S algorithm.The results show that using the optical diffraction method can design a CPP for a complicated laser system,and make the CPP have abilities of beam shaping and phase compensation for the phase aberration of the system.The method can improve the adaptation of the phase plate in systems with phase aberrations.     

Iterative algorithm for the design of diffractive phase elements for laser beam shaping

An improved iterative algorithm for designing diffractive phase elements for laser beam shaping in free space is presented. The algorithm begins with the Gerchberg-Saxton approach to obtain a stable solution. This is followed by several new iterations, in which modified constraining functions are imposed in the Fourier domain while the phase distribution of each iteration remains unchanged. For super-Gaussian beam shaping suitable for inertial confinement fusion applications the mean-square errors of the amplitude and the intensity profile of the entire beam fitted to the corresponding parameters of the 12th-power super-Gaussian beam are approximately 0.035 and 9.75x10(-3), respectively. Approximately 97.4% of the incident energy is converged into the desired region.     

Iterative computing of transmittance of optical elements focusing at a predetermined area

A new modernization of the Gerchberg-Saxton (GS) iterative algorithm has been suggested with reference to the task of focusing a coherent monochromatic beam into a preset frequency-plane domain with a given intensity distribution.

The modernization proposed permits computation of the transmittance function, within a diffraction approximation, of the optical element focusing into a preset domain, with an error essentially less than that of the standard variant of the GS algorithm.     

An Iteratively-Designed Binary Phase Grating for Flattop Beam Generation

A binary phase grating capable of shaping an incident Gaussian beam to a flattop beam in a Fourier domain is designed iteratively. It is essential in grating design to consider the phases of diffracted waves by the grating, in addition to their amplitude uniformity and diffraction efficiency. The optimized grating phase produces the in-phase diffracted waves that interfere constructively to form a uniform amplitude and phase profile. The dependence of the shaped profile on the illuminating amplitude distribution, the grating misalignment, and the lens focusing error is investigated by computer simulation and optical experiment.     

基于瑞利-索墨菲积分的大角度激光分束器设计

针对目前激光分束器只能产生小发散角的问题,基于严格的非傍轴近似的衍射积分公式,提出了一种大发散角分束器的设计方法.先对目标光场分布进行坐标和光强修整,再利用改进的GerchbergSaxton迭代算法得到所需分束器的相位分布.分别采用本文设计方法和原有方法设计了发散全角为40°×40°的5×5分束器,仿真和实验结果表明:原有方法设计得到的5×5子光束存在着显著的枕形畸变,并且光强分布不均匀.而本文方法设计得到的子光束呈均匀等间隔排列,并且强度分布更为均匀.     

Intensity control of the focal spot by vectorial beam shaping

A vectorial beam shaping algorithm is presented for the design of a phase-only diffractive optical element to achieve a given target intensity profile in the focal plane under tight focusing conditions. The underlying iterative optimization scheme is based on the Richards-Wolf vectorial diffraction theory and the Gerchberg-Saxton method, and is suitable for an arbitrary incoming polarization distribution, since only the magnitudes of the field vectors in the focal plane are reshaped. The efficiency of the method is numerically demonstrated for flat-top beam shaping examples of linear and circular incoming beam polarizations and square and circular flat-top region shape. A diffraction efficiency of 97.1% and a uniformity error of 4.8% were achieved in the case of focusing a Gaussian input beam onto a 50λ × 50λ square flat-top region with a 1.4-NA lens.     

用二元光学技术制作计算全息波面变换元件

基于计算全息原理与二元光学技术设计制作了应用于机载平视显示器（HUD）中的计算全息波面变换元件,该元件具有较高的衍射效率,一块二元相位型计算全息元件的衍射效率比一般计算全息图的衍射效率提高了四倍,并能产生传统光学元件不能实现的光学波面,如非球面,环状面和锥面等,制作工艺简单,复制简便。     

Optimized iterative quantization algorithm for phase-only beam shaping masks

In this work, we present a novel and improved method for designing a quantized phase-only beam shaping mask. The algorithm is based on iteratively quantizing the phase while forcing the phase error to produce energy outside the area of interest.The new approach performs well for binary phase-only masks even when a gray level output distribution is required. While comparing to other well-known methods, the proposed approach was found to have fast, simple and stable numerical convergence with low root mean square error as well as high efficiency and signal to noise ratio.     

Symmetrical iterative Fourier-transform algorithm using both phase and amplitude freedoms

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.