title: Fast and accurate algorithm for the computation of complex linear canonical transforms.
abstract: A fast and accurate algorithm is developed for the numerical computation of the family of complex linear canonical transforms (CLCTs), which represent the input-output relationship of complex quadratic-phase systems. Allowing the linear canonical transform parameters to be complex numbers makes it possible to represent paraxial optical systems that involve complex parameters. These include lossy systems such as Gaussian apertures, Gaussian ducts, or complex graded-index media, as well as lossless thin lenses and sections of free space and any arbitrary combinations of them. Complex-ordered fractional Fourier transforms (CFRTs) are a special case of CLCTs, and therefore a fast and accurate algorithm to compute CFRTs is included as a special case of the presented algorithm. The algorithm is based on decomposition of an arbitrary CLCT matrix into real and complex chirp multiplications and Fourier transforms. The samples of the output are obtained from the samples of the input in approximately N log N time, where N is the number of input samples. A space-bandwidth product tracking formalism is developed to ensure that the number of samples is information-theoretically sufficient to reconstruct the continuous transform, but not unnecessarily redundant.
authors.affiliation: Department of Electrical Engineering, Stanford University, Stanford, California 94305, USA. aykutkoc@stanford.edu
authors.forename: Aykut
authors.initials: A
authors.lastname: Koç
authors.forename: Haldun M
authors.initials: HM
authors.lastname: Ozaktas
authors.forename: Lambertus
authors.initials: L
authors.lastname: Hesselink