A New Discretization Algorithm of Linear Canonical Transform

Abstract In order to improve the computing accuracy of Linear Canonical Transform (LCT), a new algorithm is proposed in this paper to compute the LCT of a function by using the eigenfunctions of the LCT. The proposed algorithm is easily understanding and implementing. In addition, this algorithm has an approximation results of the continuous LCT.

[1]  Christiane Quesne,et al.  Linear Canonical Transformations and Their Unitary Representations , 1971 .

[2]  Soo-Chang Pei,et al.  Eigenfunctions of linear canonical transform , 2002, IEEE Trans. Signal Process..

[3]  Martin J. Bastiaans,et al.  Phase reconstruction from intensity measurements in one-parameter canonical-transform systems , 2003, Seventh International Symposium on Signal Processing and Its Applications, 2003. Proceedings..

[4]  Figen S. Oktem,et al.  Exact Relation Between Continuous and Discrete Linear Canonical Transforms , 2009, IEEE Signal Processing Letters.

[5]  J. Sheridan,et al.  Time Division Fast Linear Canonical Transform , 2006 .

[6]  J. Sheridan,et al.  Noninterferometric phase retrieval using a fractional Fourier system. , 2008, Journal of the Optical Society of America. A, Optics, image science, and vision.

[7]  Bryan M Hennelly,et al.  Fast numerical algorithm for the linear canonical transform. , 2005, Journal of the Optical Society of America. A, Optics, image science, and vision.

[8]  Cagatay Candan,et al.  Digital Computation of Linear Canonical Transforms , 2008, IEEE Transactions on Signal Processing.

[9]  Billur Barshan,et al.  Optimal filtering with linear canonical transformations , 1997 .