Efficient algorithms for linear canonical transforms

Bryan M. Hennelly; John T. Sheridan

doi:10.1117/12.560487

22 October 2004 Efficient algorithms for linear canonical transforms

Bryan M. Hennelly, John T. Sheridan

Proceedings Volume 5557, Optical Information Systems II; (2004) https://doi.org/10.1117/12.560487
Event: Optical Science and Technology, the SPIE 49th Annual Meeting, 2004, Denver, Colorado, United States

Abstract

We introduce a new method of deriving numerical algorithms for Linear Canonical Transforms (LCT) based on matrices, which act on phase space and distort the shape of the Wigner Distribution Function. Special cases of the LCT include the Fourier Transform (FT), the fractional Fourier Transform (FRT), the Fresnel Transform (FST). We show that many of the existing algorithms, which have been discussed in the literature, can be derived efficiently using this method. They can also be optimised and the relationship between them is discussed. In the case of the FRT all of the existing algorithms can be made index additive and reversible using correct amounts of interpolation and decimation. We derive many new algorithms for the LCT and show the means for deriving many more.

Citation Download Citation

Bryan M. Hennelly and John T. Sheridan "Efficient algorithms for linear canonical transforms", Proc. SPIE 5557, Optical Information Systems II, (22 October 2004); https://doi.org/10.1117/12.560487

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available