Abstract

The continuous linear canonical transform (LCT) can describe a wide variety of paraxial (quadratic phase) first-order optical systems. Digital algorithms to numerically calculate the LCT are therefore important in modeling the field propagations and are also of interest for many digital signal-processing applications. The continuous LCT is additive (and unitary), but discretization can destroy additivity. In this paper, the general constraint sufficient to ensure the discrete LCTs are additive is derived. Often, we wish to decompose the transform into a series of more computationally efficient steps. Having previously discussed the unitarity of such algorithms, in this paper we consider how our additivity constraint applies to the direct method (DM) and spectral method (SM) algorithms. Examples are presented showing how to correct nonadditive calculations and to appropriately choose parameters.

© 2015 Optical Society of America

Unitary discrete linear canonical transform: analysis and application

Liang Zhao, John J. Healy, and John T. Sheridan
Appl. Opt. 52(7) C30-C36 (2013)

Discrete linear canonical transforms based on dilated Hermite functions

Soo-Chang Pei and Yun-Chiu Lai
J. Opt. Soc. Am. A 28(8) 1695-1708 (2011)

Two-dimensional nonseparable linear canonical transform: sampling theorem and unitary discretization

Liang Zhao, John J. Healy, and John T. Sheridan
J. Opt. Soc. Am. A 31(12) 2631-2641 (2014)

Fast linear canonical transforms

John J. Healy and John T. Sheridan
J. Opt. Soc. Am. A 27(1) 21-30 (2010)

Random discrete linear canonical transform

Deyun Wei, Ruikui Wang, and Yuan-Min Li
J. Opt. Soc. Am. A 33(12) 2470-2476 (2016)