2008
DOI: 10.1109/tsp.2007.912890
|View full text |Cite
|
Sign up to set email alerts
|

Digital Computation of Linear Canonical Transforms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
73
0
1

Year Published

2009
2009
2022
2022

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 142 publications
(83 citation statements)
references
References 51 publications
(71 reference statements)
2
73
0
1
Order By: Relevance
“…Computation of the output samples from the input samples is fast; it takes ∼N N log time [38]. Moreover, computational accuracy arising from the use of the discrete FRT is not different than that arising from the use of the FFT to compute the common Fourier transform [31]. To summarize, we have shown that we can represent and compute the output field by using an identical number of samples as required for the input.…”
Section: Transverse Sampling Spacingmentioning
confidence: 85%
See 1 more Smart Citation
“…Computation of the output samples from the input samples is fast; it takes ∼N N log time [38]. Moreover, computational accuracy arising from the use of the discrete FRT is not different than that arising from the use of the FFT to compute the common Fourier transform [31]. To summarize, we have shown that we can represent and compute the output field by using an identical number of samples as required for the input.…”
Section: Transverse Sampling Spacingmentioning
confidence: 85%
“…One of the possible decompositions involves three stages. The first is a FRT operation, the second is a magnification operation, and the final stage is a chirp multiplication operation [28][29][30][31][32]:…”
Section: Decomposition Of Propagation In Quadratic-phase Systemsmentioning
confidence: 99%
“…All of these produce output vectors which are good approximations to the samples of the continuous transform, limited only by the fundamental fact that a signal cannot have finite extent in more than one domain; since the sampling interval is ensured to satisfy the Nyquist criterion, the output samples can be used to reconstruct good approximations of the continuous output. On the other hand, while the algorithms in [16], [17] also take time, most of them involve more than one FFT and therefore a larger factor in front, in addition to being less transparent. However, this does not automatically mean that these earlier algorithms are slower since the number of samples in these works are not directly comparable to that in this letter, as discussed below.…”
Section: Computation Of Continuous Lctsmentioning
confidence: 99%
“…In contrast, in [16], [17] it is assumed that the signal is confined to a rectangle or ellipse orthogonal to the time-frequency axes in the time-frequency plane, regardless of the parameters of the FRT or LCT to be computed. As noted, it is not possible to directly compare the present algorithm to those in [17] since different families of signals are assumed. Therefore, which algorithm is better will depend strongly on what assumptions are best suited to the family of signals we are dealing with.…”
Section: Computation Of Continuous Lctsmentioning
confidence: 99%
“…1). It is known that the Fresnel integral can be decomposed into an FRT followed by magnification followed by chirp multiplication [2][3][4][5][6]:…”
mentioning
confidence: 99%