Options
Fast linear canonical transforms
Author(s)
Date Issued
2010-01-01
Date Available
2011-11-08T11:19:37Z
Abstract
The linear canonical transform provides a mathematical model of paraxial propagation though quadratic phase systems. We review the literature on numerical approximation of this transform, including discretization,
sampling, and fast algorithms, and identify key results. We then propose a frequency-division fast linear canonical transform algorithm comparable to the Sande–Tukey fast Fourier transform. Results calculated with an implementation of this algorithm are presented and compared with the corresponding analytic functions.
sampling, and fast algorithms, and identify key results. We then propose a frequency-division fast linear canonical transform algorithm comparable to the Sande–Tukey fast Fourier transform. Results calculated with an implementation of this algorithm are presented and compared with the corresponding analytic functions.
Sponsorship
Science Foundation Ireland
Irish Research Council for Science, Engineering and Technology
Other Sponsorship
Enterprise Ireland
FÁS Science Challenge Programme
Type of Material
Journal Article
Publisher
Optical Society of America
Journal
Journal of the Optical Society of America A
Volume
27
Issue
1
Start Page
21
End Page
30
Copyright (Published Version)
2010 Optical Society of America
Subject – LCSH
Fourier transform optics
Contact transformations
Geometrical optics
Optical data processing
Web versions
Language
English
Status of Item
Peer reviewed
ISSN
1084-7529
This item is made available under a Creative Commons License
File(s)
Loading...
Name
Fast linear canonical transforms.pdf
Size
524.52 KB
Format
Adobe PDF
Checksum (MD5)
f9005d253b36246b194daf43b1cc6da4
Owning collection