Abstract
Detection of high-speed maneuvering targets has attracted a great deal of attention recently. There are two main problems to be solved: improving detection ability under the condition of complicated range migration and Doppler frequency migration effects, and reducing computational load. Different from most existing fast algorithms which are at the cost of detection ability, this paper devises a computationally attractive method with excellent detection performance. First, the keystone transform is carried out to remove linear range migration. Thereafter, a fast discrete chirp-Fourier transform (FDCFT) based on radix-4 decomposition is proposed to compensate the undersampled linear Doppler frequency migration and quadratic Doppler frequency migration. Because of exploiting inherent symmetry and periodicity as in the fast Fourier transform (FFT), the FDCFT can largely reduce the computational complexity without performance loss. The novelty of the proposed algorithm lies in combining linear transform with the concept of decimation-in-time FFT, which avoids the demanding multi-dimensional search and severe performance loss via introducing nonlinear transforms. It is shown that the proposed method has an approximately optimal detection performance but with relatively low computational cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.