Abstract
In this study, an attempt is made to evaluate discrete chirp-Fourier transform (DCFT). It is shown 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 √N, 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. It is also shown that the N-point DCFT performs optimally when N is a prime.
| Original language | English |
|---|---|
| Pages (from-to) | 27-38 |
| Number of pages | 12 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 3810 |
| Publication status | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 Radar Processing, Technology, and Applications IV - Denver, CO, USA Duration: 21 Jul 1999 → 22 Jul 1999 |