Abstract

Investigation of the discrete and fast linear canonical transforms is becoming one of the hottest research topics in modern signal processing and optics. How to handle and obtain the linear canonical frequency spectrum of very large input data based on equipment with limited memory space is one of the key problems. To focus on this problem, a new kind of segmented fast linear canonical transform has been proposed in this paper. First, the large data is segmented into short data. Thereby, the proposed algorithms can calculate very large input data and simultaneously keep the ideal frequency resolution. Second, the complexity of the derived algorithms has been analyzed in detail for different kinds of signals. Their performance with regard to resolution and precision are compared with the existing fast linear canonical transforms. Finally, experimental results are presented to verify the correctness of the results obtained.

© 2018 Optical Society of America

Fast linear canonical transforms

John J. Healy and John T. Sheridan
J. Opt. Soc. Am. A 27(1) 21-30 (2010)

Fast numerical algorithm for the linear canonical transform

Bryan M. Hennelly and John T. Sheridan
J. Opt. Soc. Am. A 22(5) 928-937 (2005)

Fast numerical calculation of the offset linear canonical transform

Jian-Yi Chen and Bing-Zhao Li
J. Opt. Soc. Am. A 40(3) 427-442 (2023)

Random discrete linear canonical transform

Deyun Wei, Ruikui Wang, and Yuan-Min Li
J. Opt. Soc. Am. A 33(12) 2470-2476 (2016)

Discrete linear canonical transforms based on dilated Hermite functions

Soo-Chang Pei and Yun-Chiu Lai
J. Opt. Soc. Am. A 28(8) 1695-1708 (2011)