Paper
16 September 2005 Recursive fast algorithm for the linear canonical transform with experimental validation
Author Affiliations +
Abstract
The Linear Canonical Transform (LCT) describes the effect of any Quadratic Phase System (QPS) on an input optical wavefield. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT) and the Fresnel Transform (FST) describing free space propagation. Recently we have published theory for the Discrete Linear Canonical Transform (DLCT), which is to the LCT what the Discrete Fourier Transform (DFT) is to the FT and we have derived the Fast Linear Canonical Transform (FLCT), a NlogN, algorithm for its numerical implementation using an approach similar to that used in deriving the FFT from the DFT. While the algorithm is significantly different to the FFT, it can be used to generate a new type of FFT algorithm using both time and frequency decimation intermittently and is based purely on the properties of the LCT and can be used for fast FT, FRT and FST calculations and in the most general case to rapidly calculate the effect of any QPS. In this paper we provide experimental validation of the algorithm in the simulation of an arbitrary two lens QPS.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
B. M. Hennelly and J. T. Sheridan "Recursive fast algorithm for the linear canonical transform with experimental validation", Proc. SPIE 5910, Advanced Signal Processing Algorithms, Architectures, and Implementations XV, 59100Z (16 September 2005); https://doi.org/10.1117/12.617860
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fourier transforms

Algorithm development

Computer simulations

Fractional fourier transform

Free space

Numerical simulations

Algorithms

Back to Top