2005
DOI: 10.1364/josaa.22.000928
|View full text |Cite
|
Sign up to set email alerts
|

Fast numerical algorithm for the linear canonical transform

Abstract: The linear canonical transform (LCT) describes the effect of any quadratic phase system (QPS) on an input optical wave field. Special cases of the LCT include the fractional Fourier transform (FRT), the Fourier transform (FT), and the Fresnel transform (FST) describing free-space propagation. Currently there are numerous efficient algorithms used (for purposes of numerical simulation in the area of optical signal processing) to calculate the discrete FT, FRT, and FST. All of these algorithms are based on the u… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
103
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 158 publications
(103 citation statements)
references
References 35 publications
0
103
0
Order By: Relevance
“…The FRT operator is additive in index: and reduces to the FT and identity operators for and . The discrete LCT of has been defined as follows for [3], [4]: is not the continuous LCT of . The special case of (3) for the FRT has been defined in [6], but we note that this definition is different than the discrete FRT in [7].…”
Section: Discrete Linear Canonical Transformsmentioning
confidence: 99%
See 1 more Smart Citation
“…The FRT operator is additive in index: and reduces to the FT and identity operators for and . The discrete LCT of has been defined as follows for [3], [4]: is not the continuous LCT of . The special case of (3) for the FRT has been defined in [6], but we note that this definition is different than the discrete FRT in [7].…”
Section: Discrete Linear Canonical Transformsmentioning
confidence: 99%
“…The Fourier and fractional Fourier transforms, coordinate scaling, and chirp multiplication and convolution operations, are special cases of LCTs. In this letter, we derive the exact relation between the continuous LCT and the discrete LCT (DLCT) defined in [3] and implemented in [4]. This provides the underlying foundation for approximately computing the samples of the LCT of a continuous signal by replacing the transform integral with a finite sum, and constitutes a generalization of the exact relation between continuous and discrete FTs, which has been regarded as a fundamental theorem by Papoulis [5].…”
mentioning
confidence: 99%
“…This approach should therefore greatly facilitate the solution of both forward and inverse problems in optical diffraction in general and holographic 3DTV in particular. An alternative approach to computing linear canonical transforms which does not involve the FFT has been presented in [11]. A comprehensive discussion of sampling issues with reference to Wigner distributions may be found in [10,30,31].…”
Section: Sampling Issues In Diffractionmentioning
confidence: 99%
“…We also analyze the evolution of spatial information along the longitudinal direction and show that the spherical reference surfaces should be equally spaced with respect to the fractional Fourier transform order. Our results are relevant to work on both sampling and fast computation of light fields propagating through quadratic-phase systems [12][13][14][15][16][17][18][19][20][21][22][23][24][25][26].…”
Section: Introductionmentioning
confidence: 99%