Estimation of FM signal parameters in impulse noise environments
Signal Processing
Multicomponent chirp signals analysis using product cubic phase function
Digital Signal Processing
Fast algorithms for polynomial time frequency transform
Signal Processing
Fourier transforms of finite chirps
EURASIP Journal on Applied Signal Processing
A new time-frequency transform for non-stationary signals with any nonlinear instantaneous phase
Multidimensional Systems and Signal Processing
The reassigned local polynomial periodogram and its properties
Signal Processing
Reassignment methods for robust time-frequency representations
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
A new LFM-signal detector based on fractional Fourier transform
EURASIP Journal on Advances in Signal Processing - Special issue on applications of time-frequency signal processing in wireless communications and bioengineering
LFM signal detection using LPP-Hough transform
Signal Processing
Lv's distribution for time-frequency analysis
CSCS '11 Proceedings of the 2nd international conference on Circuits, systems, control, signals
Efficient Deterministic Compressed Sensing for Images with Chirps and Reed-Muller Codes
SIAM Journal on Imaging Sciences
Performance analysis on Lv distribution and its applications
Digital Signal Processing
Rotation Invariance in 2D-FRFT with Application to Digital Image Watermarking
Journal of Signal Processing Systems
Hi-index | 35.68 |
The discrete Fourier transform (DFT) has found tremendous applications in almost all fields, mainly because it can be used to match the multiple frequencies of a stationary signal with multiple harmonics. In many applications, wideband and nonstationary signals, however, often occur. One of the typical examples of such signals is chirp-type signals that are usually encountered in radar signal processing, such as synthetic aperture radar (SAR) and inverse SAR imaging. Due to the motion of a target, the radar return signals are usually chirps, and their chirp rates include the information about the target, such as the location and the velocity. In this paper, we study discrete chirp-Fourier transform (DCFT), which is analogous to the 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 when the signal length N is prime, the magnitudes of all the sidelobes of the DCFT of a quadratic chirp signal are 1, whereas the magnitude of the mainlobe of the DCFT is √N. With this result, an upper bound for the number of the detectable chirp components using the DCFT is provided in terms of signal length and signal and noise powers. We also show that the N-point DCFT performs optimally when N is a prime