光学学报, 2016, 36 (4): 0405001, 网络出版: 2016-04-13
一种快速实现光场传输的算法研究
Study of an Arithmetic for Fast Computing Transmission of Light Field
衍射 光场传输 矩阵相乘 运算速度 精细度 相干合束 diffraction transmission of light field matrix multiplication speed accuracy coherent combination
摘要
针对目前实现光场传输的两种算法无法同时满足运算速度和精细度的问题,提出了矩阵相乘算法,阐明了其实现思想,推导了其实现过程。结合激光相干合束实例进行了仿真分析,结果表明,对于六路高斯光束的相干合束,快速傅里叶变换算法耗时短,但无法得到精确的计算结果;积分算法和矩阵相乘算法均可获得远场准确的光强分布,但积分算法需耗时15.7 h,而矩阵相乘算法仅需2 s,提高了运算效率。证明了矩阵相乘算法具有快速、准确的优点。
Abstract
In order to solve the problems of speed and accuracy in computing the transmission of light field by the current two kinds of arithmetics, a novel arithmetic of matrix multiplication is proposed. The implementation idea and procedures are given. A simulation example is based on six Gaussian beams coherent combination. The result shows that the speed of fast Fourier transform is perfect, but the calculation is not very accurate. However, the integral arithmetic and the matrix multiplication arithmetic can all get exact far-field intensity distributions. The time costed by these two arithmetics is evenly matched. The former needs 15.7 h and the latter only needs about 2 s. The comparison proves that the matrix multiplication arithmetic has advantages of fast and accuracy, which improves the calculation efficiency considerably.
龚海龙, 李国俊, 陈琪, 方亮, 周崇喜. 一种快速实现光场传输的算法研究[J]. 光学学报, 2016, 36(4): 0405001. Gong Hailong, Li Guojun, Chen Qi, Fang Liang, Zhou Chongxi. Study of an Arithmetic for Fast Computing Transmission of Light Field[J]. Acta Optica Sinica, 2016, 36(4): 0405001.