Discrete chirp-Fourier transform

Xiang-Gen Xia

doi:10.1117/12.364079

29 September 1999 Discrete chirp-Fourier transform

Xiang-Gen Xia

Proceedings Volume 3810, Radar Processing, Technology, and Applications IV; (1999) https://doi.org/10.1117/12.364079
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1999, Denver, CO, United States

Abstract

In this paper, we study discrete chirp-Fourier transform (DCFT), which is analogous to the Discrete Fourier transform (DFT). Besides the multiple frequency matching similar to the DFT, the DCFT can be used to match the multiple chirp rates in a chirp-type signal with multiple chirp components. We show that the magnitudes of all the sidelobes of the DCFT of a quadratic chirp signal are 1 while the magnitude of the mainlobe of the DCFT is yieldsN, where N is a prime and is the length of the signal. With this result, an upper bound for the number of the detectable chirp components using the DCFT is provided in terms of signal length, signal and noise powers. We also show that the N-point DCFT performance optimally when N is a prime.

Citation Download Citation

Xiang-Gen Xia "Discrete chirp-Fourier transform", Proc. SPIE 3810, Radar Processing, Technology, and Applications IV, (29 September 1999); https://doi.org/10.1117/12.364079

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available