Fast numerical algorithm for the linear canonical transform
Files in This Item:
|Fast numerical algorithm for the linear canonical transform.pdf||190.42 kB||Adobe PDF||Download|
|Title:||Fast numerical algorithm for the linear canonical transform||Authors:||Hennelly, Bryan M.
Sheridan, John T.
|Permanent link:||http://hdl.handle.net/10197/3368||Date:||1-May-2005||Abstract:||The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave ﬁeld. 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.||Funding Details:||Science Foundation Ireland
Irish Research Council for Science, Engineering and Technology
|Type of material:||Journal Article||Publisher:||Optical Society of America||Copyright (published version):||2005 Optical Society of America||Subject LCSH:||Contact transformations
Optical data processing
Image processing--Digital techniques
Fourier transform optics
|DOI:||10.1364/JOSAA.22.000928||Language:||en||Status of Item:||Not peer reviewed|
|Appears in Collections:||Electrical and Electronic Engineering Research Collection|
Show full 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.