分数傅里叶全息图的算法研究及显示

为了快速获取更好的全息图显示效果,在研究了分数傅里叶变换与菲涅耳衍射光场的紧密联系的基础上,首先给出了一种分数傅里叶变换的快速数值算法,并将分数傅里叶变换应用到计算全息图中提出了一种用于计算全息图的分数傅里叶变换方法;然后分析了用这种记录全息的方法得到的全息图优越于传统的傅里叶变换获得的全息图,同时给出了计算机的模拟实验结果;最后利用拆卸的投影装置搭建出了以空间光调制器——DMD (数字微镜装置)为核心的全息显示光学系统,并在该系统下获得了用分数傅里叶变换计算得到的全息图的全息显示结果。     

分数傅里叶变换合成计算全息与数字重现

传统的计算全息图大多采用菲涅耳衍射积分得到,但菲涅耳衍射积分在描述整个衍射光场中,没有一个统一的采样方法对积分进行数值计算,从而给计算带来不便。为了更好地研究计算全息图问题,文章引入了分数傅里叶变换,通过利用分数傅里叶变换的一种快速数值模拟算法,提出了一种基于分数傅里叶变换的合成空间三维物体全息图的新方法,并用计算机模拟了合成的全息图及其数字重构的结果。实验结果表明:由于分数阶的引入,得到一种处理光场衍射问题的统一算法,因此用分数傅里叶变换来处理光场衍射问题是十分理想的。     

分数傅立叶全息图的算法研究及系统实现

将分数傅里叶变换引入到全息图的计算中,提出一种分数傅立叶变换产生计算全息图的方法,并利用拆卸的投影装置搭建出以空间光调制器DMD为核心的全息显示光学系统并获得了分数傅里叶变换计算全息图在该系统下的全息显示效果及计算机模拟效果。     

分数傅里叶变换的快速算法及计算全息图的研究

通过分析菲涅耳衍射积分的快速算法,依据Lohmann提出的任意阶的分数傅里叶变换的单透镜光学实验装置,详细分析了光场在此单透镜系统中的传播过程,提出了一种基于傅里叶变换的分数傅里叶变换快速算法,并对基于此快速算法的分数傅里叶变换全息图的计算机生成与数字重现进行了研究。实验结果示出了分数傅里叶变换全息图及其在重构过程中分数阶匹配与否的实验结果,验证了分数傅里叶变换分数阶的重要性质和笔者提出算法的可行性。     

分数傅里叶变换的快速算法及计算全息图的研究

通过分析菲涅耳衍射积分的快速算法，依据Lohmann提出的任意阶的分数傅里叶变换的单透镜光学实验装置，详细分析丁光场在此单透镜系统中的传播过程，提出了一种基于傅里叶变换的分数傅里叶变换快速算法，并对基于此快速算法的分数傅里叶变换全息图的计算机生成与数字重现进行了研究。实验结果示出了分数傅里叶变换全息图及其在重构过程中分数阶匹配与否的实验结果，验证了分数傅里叶变换分数阶的重要性质和笔者提出算法的可行性。     

分数傅里叶全息图的快速算法及数字重现

论文通过分析菲涅耳衍射积分的快速算法,提出了一种基于快速傅里叶变换的分数傅里叶变换的数值模拟算法,并研究了基于此快速算法的分数傅里叶变换全息图的计算机生成及数字重现。     

基于DMD和分数傅里叶的动态全息体视图显示

体视全息术是一种准三维显示技术,较之传统全息图,体视全息图大大降低了记录物体三维信息的数据量,使得计算机生成体视全息图成为可能,而空间光调制器SLM的不断发展也推动了全息显示系统的发展.分析了数字微镜器件DMD对光场的调制特性,将分数傅里叶变换算法用于体视全息图的生成,提出一种基于DMD的全息显示系统,实现了分数傅里叶变换体视全息图的动态显示.实验结果表明该系统能够较好地产生动态3D透视感,为基于DMD的全息显示搭建了系统平台.     

一种新型全息图的编码方法

为了提高计算全息图的衍射效率,以目前计算全息领域中显示纹理较为清晰的傅里叶全息图为基础,提出了一种新的全息图制作与显示方法。采用离散余弦变换生成相应的全息图,采用逆离散余弦变换对其进行重构。通过该方法所得的全息图的衍射效率比采用傅里叶算法的全息图的衍射效率提高了13.65%,有效衍射效率提高了56.82%,从计算机模拟再现的结果可以看出,得到了一种显示效果清晰的、衍射效率更高的新型全息图。     

一种三维快速傅里叶变换并行算法

三维快速傅里叶变换在物理计算领域中被广泛地使用.传统并行算法所使用的面划分和块划分方法并不适合稀疏三维向量的傅里叶变换.提出了一种新三维快速傅里叶变换的并行算法,针对稀疏三维向量的傅里叶变换,新算法通过重新调整x,Y,z三个方向的计算顺序,能最大限度地减少计算量以及进程间的通信量,从而减少计算时间,提高并行加速比.详尽的理论分析以及多个高性能计算平台上的实验结果证明:在对稀疏三维向量作傅里叶变换时,新算法优于传统算法.     

一种基于图像的全息图计算方法及其模拟重现

传统的计算机产生全息图方法由于在标量衍射的光场描述中没有统一的数值计算方法从而计算复杂度高,而且重构的3D图像的体积和视场都比较小,离市场化的要求较远.提出一种基于图像(而又不同于体视全息)频谱的计算全息图方法,实现了一种基于图像生成全息图的计算及其计算机显示,模拟实验结果验证了算法的正确性.     

一类分数傅里叶变换图像加密算法的安全分析

从分数阶傅里叶变换的性质出发,对一类分数阶傅里叶变换图像加密算法进行分析。对原有算法结果图进行肉眼判断,提取图像中间结果数据进行对比分析,可知算法的密钥具有不敏感性,并且解密图具有很大失真。对分数傅里叶变换进行理论上的分析和讨论。分析及实验结果表明,直接使用分数阶傅里叶变换进行加密的算法对密钥并不敏感,存在安全隐患。为实现密文图像的显示和传输而引入的RGB映射将导致解密图像像素值失真。     

Research progress on discretization of fractional Fourier transform

As the fractional Fourier transform has attracted a considerable amount of attention in the area of optics and signal processing, the discretization of the fractional Fourier transform becomes vital for the application of the fractional Fourier transform. Since the discretization of the fractional Fourier transform cannot be obtained by directly sampling in time domain and the fractional Fourier domain, the discretization of the fractional Fourier transform has been investigated recently. A summary of discretizations of the fractional Fourier transform developed in the last nearly two decades is presented in this paper. The discretizations include sampling in the fractional Fourier domain, discrete-time fractional Fourier transform, fractional Fourier series, discrete fractional Fourier transform （including 3 main types： linear combination-type; sampling-type; and eigen decomposition-type）, and other discrete fractional signal transform. It is hoped to offer a doorstep for the readers who are interested in the fractional Fourier transform.     

MIMO-OFDM system based on fractional Fourier transform and selecting algorithm for optimal order

In the rapidly time-varying channel environment, the performance of traditional MIMO-OFDM system is deteriorated due to the intercarrier interference. In this paper, a novel MIMO-OFDM system is proposed, in which the modulation and de- modulation of the symbols are implemented by the fractional Fourier transform instead of traditional Fourier transform. Through selecting the optimal order of the fractional Fourier transform, the modulated signals can match the time-varying channel characteristics, which results in a mitigation of the intercarrier interference. Furthermore, an algorithm is presented for selecting the optimal order of fractional Fourier transform, and the impact of system parameters on the optimal order is analyzed. Simulation results show that the proposed system can concentrate the power of desired signal effectively and improve the performance over rapidly time-varying channels with respect to the traditional MIMO-OFDM system.     

The fractional Fourier transform: theory, implementation and error analysis

The fractional Fourier transform is a time–frequency distribution and an extension of the classical Fourier transform. There are several known applications of the fractional Fourier transform in the areas of signal processing, especially in signal restoration and noise removal. This paper provides an introduction to the fractional Fourier transform and its applications. These applications demand the implementation of the discrete fractional Fourier transform on a digital signal processor (DSP). The details of the implementation of the discrete fractional Fourier transform on ADSP-2192 are provided. The effect of finite register length on implementation of discrete fractional Fourier transform matrix is discussed in some detail. This is followed by the details of the implementation and a theoretical model for the fixed-point errors involved in the implementation of this algorithm. It is hoped that this implementation and fixed-point error analysis will lead to a better understanding of the issues involved in finite register length implementation of the discrete fractional Fourier transform and will help the signal processing community make better use of the transform.     

The multiple-parameter fractional Fourier transform

The fractional Fourier transform （FRFT） has multiplicity, which is intrinsic in fractional operator. A new source for the multiplicity of the weight-type fractional Fourier transform （WFRFT） is proposed, which can generalize the weight coefficients of WFRFT to contain two vector parameters m,n ∈ Z^M . Therefore a generalized fractional Fourier transform can be defined, which is denoted by the multiple-parameter fractional Fourier transform （MPFRFT）. It enlarges the multiplicity of the FRFT, which not only includes the conventional FRFT and general multi-fractional Fourier transform as special cases, but also introduces new fractional Fourier transforms. It provides a unified framework for the FRFT, and the method is also available for fractionalizing other linear operators. In addition, numerical simulations of the MPFRFT on the Hermite-Gaussian and rectangular functions have been performed as a simple application of MPFRFT to signal processing.