A fast algorithm for the linear canonical transform
From MaRDI portal
Publication:548858
DOI10.1016/J.SIGPRO.2010.07.007zbMATH Open1219.65168arXiv0912.1379OpenAlexW1967204380MaRDI QIDQ548858FDOQ548858
Authors: Rafael G. Campos, Jared Figueroa 
Publication date: 30 June 2011
Published in: Signal Processing (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0912.1379
Recommendations
- Fast Algorithms for Digital Computation of Linear Canonical Transforms
- scientific article
- 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
FFTHermite polynomialsquadraturelinear canonical transformfractional Fourier transformfractional discrete Fourier transform
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integral transforms in science and engineering
- Digital Computation of Linear Canonical Transforms
- Uncertainty Principle for Real Signals in the Linear Canonical Transform Domains
- Linear Canonical Transformations and Their Unitary Representations
- The Fractional Order Fourier Transform and its Application to Quantum Mechanics
- Sampling and discretization of the linear canonical transform
- Sampling of linear canonical transformed signals
- New sampling formulae related to linear canonical transform
- Eigenfunctions of linear canonical transform
- A quadrature formula for the Hankel transform
- Quadrature formulas for integrals transforms generated by orthogonal polynomials
Cited In (7)
- Computation of the short-time linear canonical transform with dual window
- An algorithm for the computation of the Tustin bilinear transformation
- Development of Linear Canonical Transforms: A Historical Sketch
- Stability estimates for phase retrieval from discrete linear canonical Gabor transformation measurements
- The interlaced chirp Z transform
- Fast Algorithms for Digital Computation of Linear Canonical Transforms
- Paley-Wiener theorems and uncertainty principles for the windowed 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)
