Fast Discrete Linear Canonical Transform Based on CM-CC-CM Decomposition and FFT

DOI10.1109/TSP.2015.2491891MaRDI QIDQ4618178zbMATH OpenFDO

Authors Soo-Chang Pei, Shih-Gu Huang

Publication date 7 February 2019

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Detection theory in information and communication theory (94A13)

Abstract: In this paper, a discrete LCT (DLCT) irrelevant to the sampling periods and without oversampling operation is developed. This DLCT is based on the well-known CM-CC-CM decomposition, that is, implemented by two discrete chirp multiplications (CMs) and one discrete chirp convolution (CC). This decomposition doesn't use any scaling operation which will change the sampling period or cause the interpolation error. Compared with previous works, DLCT calculated by direct summation and DLCT based on center discrete dilated Hermite functions (CDDHFs), the proposed method implemented by FFTs has much lower computational complexity. The relation between the proposed DLCT and the continuous LCT is also derived to approximate the samples of the continuous LCT. Simulation results show that the proposed method somewhat outperforms the CDDHFs-based method in the approximation accuracy. Besides, the proposed method has approximate additivity property with error as small as the CDDHFs-based method. Most importantly, the proposed method has perfect reversibility, which doesn't hold in many existing DLCTs. With this property, it is unnecessary to develop the inverse DLCT additionally because it can be replaced by the forward DLCT.

Cited in

(4)

• Computation of the short-time linear canonical transform with dual window
• Fast Algorithms for Digital Computation of Linear Canonical Transforms
• A fast algorithm for the linear canonical transform
• Inversion of the windowed linear canonical transform with Riemann sums

This page was built for publication: Fast Discrete Linear Canonical Transform Based on CM-CC-CM Decomposition and FFT

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