A fast algorithm for the linear canonical transform

DOI10.1016/j.sigpro.2010.07.007zbMath1219.65168arXiv0912.1379OpenAlexW1967204380MaRDI QIDQ548858

Jared Figueroa, Rafael G. Campos

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 polynomialsquadraturefractional Fourier transformlinear canonical transformfractional discrete Fourier transform

Mathematics Subject Classification ID

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

Related Items (5)

Stability estimates for phase retrieval from discrete linear canonical Gabor transformation measurements ⋮ Computation of the short-time linear canonical transform with dual window ⋮ Fast Algorithms for Digital Computation of Linear Canonical Transforms ⋮ Development of Linear Canonical Transforms: A Historical Sketch ⋮ Paley-Wiener theorems and uncertainty principles for the windowed linear canonical transform

Cites Work

• Unnamed Item
• Unnamed Item
• New sampling formulae related to linear canonical transform
• Sampling and discretization of the linear canonical transform
• Sampling of linear canonical transformed signals
• Integral transforms in science and engineering
• A quadrature formula for the Hankel transform
• Quadrature formulas for integrals transforms generated by orthogonal polynomials
• The Fractional Order Fourier Transform and its Application to Quantum Mechanics
• Digital Computation of Linear Canonical Transforms
• Uncertainty Principle for Real Signals in the Linear Canonical Transform Domains
• Eigenfunctions of linear canonical transform
• Linear Canonical Transformations and Their Unitary Representations

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