Browsing by Subject "Lossless"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Degrees of freedom of optical systems and signals with applications to sampling and system simulation
    (Optical Society of America, 2013) Oktem F.S.; Özaktaş, Haldun M.
    We study the degrees of freedom of optical systems and signals based on space-frequency (phase space) analysis. At the heart of this study is the relationship of the linear canonical transform domains to the space-frequency plane. Based on this relationship, we discuss how to explicitly quantify the degrees of freedom of first-order optical systems with multiple apertures, and give conditions for lossless transfer. Moreover, we focus on the degrees of freedom of signals in relation to the space-frequency support and provide a sub-Nyquist sampling approach to represent signals with arbitrary space-frequency support. Implications for simulating optical systems are also discussed. © 2013 Optical Society of America.
  • Thumbnail Image
    ItemOpen Access
    Fast and accurate algorithm for the computation of complex linear canonical transforms
    (Optical Society of America, 2010-08-05) Koç A.; Özaktaş, Haldun M.; Hesselink, L.
    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.