A fast algorithm for the linear canonical transform

DOI10.1016/J.SIGPRO.2010.07.007MaRDI QIDQ548858zbMATH OpenOpenAlexFDO

Authors Rafael G. Campos, Jared Figueroa

Publication date 30 June 2011

Published in Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0912.1379

zbMATH Keywords

FFTHermite polynomialsquadraturelinear canonical transformfractional Fourier transformfractional discrete Fourier transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Abstract: In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this paper we obtain an O(N*Log N) algorithm to compute the LCT by using a chirp-FFT-chirp transformation yielded by a convergent quadrature formula for the fractional Fourier transform. This formula gives a unitary discrete LCT in closed form. In the case of the fractional Fourier transform the algorithm computes this transform for arbitrary complex values inside the unitary circle and not only at the boundary. In the case of the ordinary Fourier transform the algorithm improves the output of the FFT.

Recommendations

• Fast Algorithms for Digital Computation of Linear Canonical Transforms
• scientific article; zbMATH DE number 4100583
• Fast Discrete Linear Canonical Transform Based on CM-CC-CM Decomposition and FFT
• A fast computational algorithm for the Legendre-Fenchel transform
• Digital Computation of Linear Canonical Transforms
• scientific article; zbMATH DE number 766215
• Fast Numerical Computation of Two-Dimensional Non-Separable Linear Canonical Transform Based on Matrix Decomposition
• Fast transforms for tridiagonal linear equations
• Linear canonical transforms. Theory and applications
• scientific article; zbMATH DE number 16811

Cites work

• scientific article; zbMATH DE number 3477793 (Why is no real title available?)
• scientific article; zbMATH DE number 3081880 (Why is no real title available?)
• A quadrature formula for the Hankel transform
• Digital Computation of Linear Canonical Transforms
• Eigenfunctions of linear canonical transform
• Integral transforms in science and engineering
• Linear Canonical Transformations and Their Unitary Representations
• New sampling formulae related to linear canonical transform
• Quadrature formulas for integrals transforms generated by orthogonal polynomials
• Sampling and discretization of the linear canonical transform
• Sampling of linear canonical transformed signals
• The Fractional Order Fourier Transform and its Application to Quantum Mechanics
• Uncertainty Principle for Real Signals in the Linear Canonical Transform Domains

Cited in

(8)

• An algorithm for the computation of the Tustin bilinear transformation
• Fast Algorithms for Digital Computation of Linear Canonical Transforms
• The interlaced chirp Z transform
• Development of linear canonical transforms: a historical sketch
• Computation of the short-time linear canonical transform with dual window
• Paley-Wiener theorems and uncertainty principles for the windowed linear canonical transform
• Stability estimates for phase retrieval from discrete linear canonical Gabor transformation measurements
• Eigenfunctions of the linear canonical transform

This page was built for publication: A fast algorithm for the linear canonical transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548858)