The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Fast numerical algorithm for the linear canonical transform
Open accessAbstract
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 use of the fast Fourier transform (FFT). In this paper we develop theory for the discrete linear canonical transform (DLCT), which is to the LCT what the discrete Fourier transform (DFT) is to the FT. We then derive the fast linear canonical transform (FLCT), an N log N algorithm for its numerical implementation by an approach similar to that used in deriving the FFT from the DFT. Our algorithm is significantly different from the FFT, is based purely on the properties of the LCT, and can be used for FFT, FRT, and FST calculations and, in the most general case, for the rapid calculation of the effect of any QPS.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
On the Quantum Correction For Thermodynamic Equilibrium
Wigner, E. (1932) · Physical Review · doi:10.1103/physrev.40.749 · Cited by 9,283 · cited 1×
“(30) n takes values in the range −N /4ønø−1.”
Digital computation of the fractional Fourier transform
Ozaktas, H. M., Arikan, O., Kutay, M. A., & Bozdagt, G. (1996) · IEEE Transactions on Signal Processing · doi:10.1109/78.536672 · Cited by 1,187
The discrete fractional Fourier transform
Candan, C., Kutay, M. A., & Ozaktas, H. M. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.839980 · Cited by 683
Cited by
A review of optical image encryption techniques
Liu, S., Guo, C., & Sheridan, J. T. (2014) · Optics & Laser Technology · doi:10.1016/j.optlastec.2013.05.023 · Cited by 406
Self-citation
Metadata
- Authors
- Hennelly, B. M., & Sheridan, J. T.
- Venue
- Journal of the Optical Society of America A
- Publisher
- Optica Publishing Group
- Published
- 2005-05-01
- Volume
- 22
- Issue
- 5
- Pages
- 928
- ISSN
- 1084-7529 (ISSN-L)
- 1520-8532
- OpenAlex
- W2149855663
- Cited by
- 176
- References
- 4
- FWCI
- 19.69
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fast numerical algorithm for the linear canonical transform. https://app.cochat.ai/papers/10.1364/josaa.22.000928
- The paper
- Hennelly, B. M., & Sheridan, J. T. (2005). Fast numerical algorithm for the linear canonical transform. Journal of the Optical Society of America A. https://doi.org/10.1364/josaa.22.000928
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.