Discrete Linear Canonical Feature Research of Chirp Signal

Abstract:

The Chirp signal has many advantages that widely applied in communication, sonar, radar and other information processing fields as a common pulse compressional signal. The paper brought out an expression of the kernel of the Linear Canonical Transform (LCT) using its eigenfunctions. According to new expression, LCT can be expressed in terms of a new definition. Based on principle of sampling in time and LCT domains, a new definition of Discrete Linear Canonical Transform (DLCT) was put forward. The paper then proposed how to calculate DLCT of chirp signal in accordance with this new definition. Compared with other algorithms presented recently, it has more approximate results of continuous LCT.

• Periodical: Applied Mechanics and Materials (Volumes 401-403)
• Pages: 1362-1367
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.401-403.1362
• Online since: September 2013
• Authors: Ji Jun Xu, Tao Liu
• Keywords: Chirp Signal, Discrete Linear Canonical Feature, FFT

References

[1] Bryan M. Hennelly, John T. Sheridan, Fast Numerical Algorithm for the Linear Canonical Transform, Journal of Optical Society of America, Optics, Image science and Vision, Vol. 22, No. 5, (2005) 918-937.

DOI: 10.1364/josaa.22.000928

[2] John J. Healy, John T. Sheridan, Time Division Fast Linear Canonical Transform, IEEE Transactions on Signal Processing, Proceedings of 2006 IET Irish Signals and Systems Conference, (2006) 135-138.

DOI: 10.1049/cp:20060426

[3] Aykut Koc, Haldun M. Ozaktas, M. Alper Kutay, Digital Computation of Linear Canonical Transforms, IEEE Transactions on Signal Processing, Vol. 56, No. 6, (2008) 2383-2394.

DOI: 10.1109/tsp.2007.912890

[4] Figen S. Oktem, Haldun M. Ozakta, Exact Relation Between Continuous and Discrete Linear Canonical Transforms, IEEE Signal Processing letters, Vol. 16, No. 8, (2009) 727-730.

DOI: 10.1109/lsp.2009.2023940

[5] John J. Healy, John T. Sheridan, Sampling and Discretization of the Linear Canonical Transform, Signal Processing, Vol. 55, No. 4, (2009) 641-648.

DOI: 10.1016/j.sigpro.2008.10.011

[6] Xian-jun Ping, Ran Tao, Si-yong Zhou, Yue Wang, A Novel Fast Algorithm for Fractional Fourier Transform, Acta Electronica Sinica, Vol. 29, No. 3, (2001) 406-408.

[7] L. B. Almeida, The Fractional Fourier Transform and Time-frequency Representation, IEEE Transactions on Signal Processing, Vol. 42, No. 11, (1994) 3084-3091.

DOI: 10.1109/78.330368

[8] C. Candan, M. A. Kutay, H. M. Ozaktas, The Discrete Fractional Fourier Transform, IEEE Transactions on Signal Processing, Vol. 48, No. 5, (2000) 1329-1337.

DOI: 10.1109/78.839980

[9] Ming-hui Deng, Qing-shuang Zeng, Lan-ying Zhang, An Information Fusion Algorithm Based on Chirplet-Hough Transformation, Journal of Convergence Information Technology, Vol. 7, No. 19, (2012) 426-433.

DOI: 10.4156/jcit.vol7.issue19.50

[10] Min-Hung Yeh, Soo-Chang Pei, A method for the discrete fractional Fourier transform computation, IEEE Transactions on Signal Processing, Vol. 51, No. 3, (2003) 889-891.

DOI: 10.1109/tsp.2002.808113

[11] Bing-zhao Li, Ran Tao, Yue Wang, New sampling formulae related to linear canonical transform, Signal Processing, Vol. 87, No. 5, (2002) 983-990.

DOI: 10.1016/j.sigpro.2006.09.008

[12] Han-ming Huang, Hai-jun Zhou, Yin-ju Bian, The Development of Decision Support System for Identifying Explosion Events by Seismic Waves, International Journal of Digital Content Technology and its Applications, Vol. 5, No. 4, (2011) 107-112.

DOI: 10.4156/jdcta.vol5.issue4.13

[13] Fu-guo Dong, Tong Zhou, Ping-qin Wang, A Novel FFT Based Fast Algorithm for Solving High-Order Polynomial, International Journal of Digital Content Technology and its Applications, Vol. 5, No. 2, (2011) 126-132.

DOI: 10.4156/jdcta.vol5.issue2.14