Fast and accurate algorithm for the computation of complex linear canonical transforms
Ozaktas, H., M.
Journal of the Optical Society of America A: Optics and Image Science, and Vision
OSA - The Optical Society
1896 - 1908
MetadataShow full item record
Please cite this item using this persistent URLhttp://hdl.handle.net/11693/22227
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 ∼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. © 2010 Optical Society of America.
Showing items related by title, author, creator and subject.
Sparse representation of two- and three-dimensional images with fractional Fourier, Hartley, linear canonical, and Haar wavelet transforms Koç A.; Bartan B.; Gundogdu E.; Çukur T.; Ozaktas H.M. (Elsevier Ltd, 2017)Sparse recovery aims to reconstruct signals that are sparse in a linear transform domain from a heavily underdetermined set of measurements. The success of sparse recovery relies critically on the knowledge of transform ...
Fast and accurate linear canonical transform algorithms [Hizli ve Hassas Doʇrusal Kanonik Dönüşüm Algoritmalari] Özaktaş H.M.; Koç, A. (Institute of Electrical and Electronics Engineers Inc., 2015)Linear canonical transforms are encountered in many areas of science and engineering. Important transformations such as the fractional Fourier transform and the ordinary Fourier transform are special cases of this transform ...
Onural, L.; Erden, M. F.; Ozaktas, H. M. (IEEE, 1997-11)The extended versions of common Laplace and Fourier transforms are given. This is achieved by defining a new function fe(p), p 2 C related to the function to be transformed f(t), t 2 R. Then fe(p) is transformed by an ...