1 September 2004 Fast algorithm for determination of linear canonical transform and fractional fourier transform
Author Affiliations +
Abstract
The fractional Fourier transform (FRT) is a recently developed tool for linear space-frequency (or time-frequency) signal processing. It is a generalisation of the Fourier transform, FT, has a simple optical implementation and can potentially find use wherever the FT is used. We discuss and compare the most popular fast algorithms currently being used (in the area of optical signal processing, OSP) to calculate the digital FRT. We develop theory for the discrete Linear Canonical Transform (LCT) of which the FRT is a special case. We then derive the Fast Linear Canonical Transform (FLCT), a fast algorithm for its implementation using a similar approach as was done with the derivation of the Fast Fourier Transform (FFT) for implementation of the Discrete Fourier Transform (DFT). The new algorithm is entirely independent of the FFT and is based purely on the properties of the LCT and FRT.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Bryan M. Hennelly, Bryan M. Hennelly, John T. Sheridan, John T. Sheridan, } "Fast algorithm for determination of linear canonical transform and fractional fourier transform", Proc. SPIE 5456, Photon Management, (1 September 2004); doi: 10.1117/12.553299; https://doi.org/10.1117/12.553299
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Optical Crossbar Signal Processor
Proceedings of SPIE (January 03 1986)
Cross Hilbert time-frequency distributions
Proceedings of SPIE (October 01 1998)
Generalized scale transforms
Proceedings of SPIE (November 01 1999)

Back to Top