Fast numerical algorithm for the linear canonical transform

DSpace/Manakin Repository

Show simple item record Hennelly, Bryan M. Sheridan, John T. 2011-12-01T11:27:06Z 2011-12-01T11:27:06Z 2005 Optical Society of America en 2005-05-01
dc.identifier.citation Journal of the Optical Society of America A en
dc.identifier.issn 1084-7529
dc.identifier.issn 1520-8532
dc.description.abstract The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave field. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT), and the Fresnel transform (FST) describing free-space propagation. Currently there are numerous efficient algorithms used (for purposes of numerical simulation in the area of optical signal processing) to calculate the discrete FT, FRT, and FST. All of these algorithms are based on the use of the fast Fourier transform (FFT). In this paper we develop theory for the discrete linear canonical transform (DLCT), which is to the LCT what the discrete Fourier transform (DFT) is to the FT. We then derive the fast linear canonical transform (FLCT), an N log N algorithm for its numerical implementation by an approach similar to that used in deriving the FFT from the DFT. Our algorithm is significantly different from the FFT, is based purely on the properties of the LCT, and can be used for FFT, FRT, and FST calculations and, in the most general case, for the rapid calculation of the effect of any QPS. en
dc.description.sponsorship Science Foundation Ireland en
dc.description.sponsorship Irish Research Council for Science, Engineering and Technology en
dc.format.extent 194995 bytes
dc.format.extent 1072 bytes
dc.format.mimetype application/pdf
dc.format.mimetype text/plain
dc.language.iso en en
dc.publisher Optical Society of America en
dc.rights This paper was published in Journal of the Optical Society of America A and is made available as an electronic reprint with the permission of OSA. The paper can be found at the following URL on the OSA website: Systematic or multiple reproduction or distribution to multiple locations via electronic or other means is prohibited and is subject to penalties under law. en
dc.subject.lcsh Contact transformations en
dc.subject.lcsh Optical data processing en
dc.subject.lcsh Image processing--Digital techniques en
dc.subject.lcsh Fourier transform optics en
dc.title Fast numerical algorithm for the linear canonical transform en
dc.type Journal Article en
dc.internal.availability Full text available en
dc.internal.webversions en
dc.status Not peer reviewed en
dc.identifier.volume 22 en
dc.identifier.issue 5 en
dc.identifier.startpage 928 en
dc.identifier.endpage 937 en
dc.identifier.doi 10.1364/JOSAA.22.000928
dc.neeo.contributor Hennelly|Bryan M.|aut| en
dc.neeo.contributor Sheridan|John T.|aut| en
dc.description.othersponsorship Enterprise Ireland en
dc.description.admin da, pe, la, sp, ke, ab, is, en - kpw24/11/11 en

This item appears in the following Collection(s)

Show simple item record

This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

If you are a publisher or author and have copyright concerns for any item, please email and the item will be withdrawn immediately. The author or person responsible for depositing the article will be contacted within one business day.

Search Research Repository

Advanced Search