检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:蒋晓瑜[1] 丛彬[1] 裴闯[1] 闫兴鹏[1] 赵锴[1]
出 处:《光学学报》2015年第2期80-87,共8页Acta Optica Sinica
基 金:全国优秀博士学位论文作者专项资金资助项目(201432);北京市自然科学基金(4152049)
摘 要:为解决点源法计算全息速度较慢的问题,提出了一种新的查表算法,命名为三角函数查表法(T-LUT算法)。该算法是基于点源法基本的数学公式,通过一系列数学近似与恒等变换,生成了一种纯相位查找表,该查找表具有三维特性,并具有生成速度快、精度高、占用内存少等特点,克服了点源法重复计算相位的缺点。同时采用统一计算设备架构(CUDA)并行计算在图形处理器(GPU)上加以实现,并进行了三次并行优化。在算法的验证与对比实验中,采用单显卡(GPU显卡)实现T-LUT算法,在不牺牲全息图再现像质量的前提下,成功地将点源法计算全息的速度大幅度提升。实验发现在不同的物空间采样点数量的情况下,速度相对于点源法GPU运算提升30倍至近千倍不等。We propose a new look-up table algorithm, named trigonometric look-up tables (T-LUT) method to increase the speed of coherent ray trace (CRT) algorithm in generating holograms. The proposed algorithm is based on the original ray tracing method. By using a series of mathematical approximation changes and identical transformations, we generate a pure phase look-up table. This look-up table has three-dimensional features, fast generating speed, high precision, less memory capacity and so on. The new method overcomes CRT's shortcomings in computing the phase repeatedly. We implement T-LUT on graphics processing unit (GPU) using parallel computing by compute unified device architecture (CUDA), and optimize it three times. After algorithm optimizing, a series of experiments are carried out to verify the results by using a single GPU card. Our results indicate that the T-LUT algorithm can effectively shorten the computing time without sacrificing the quality of hologram reconstruction. Due to the different quantities of spatial samples, the speed has increased 30 to nearly a thousand times compared with original ray tracing algorithm implemented on GPU.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.219.214