Research On High - Speed Target Detection Algorithm

In recent years, with the appearance of various kinds of high-speed and ultra-high speed aircraft, traditional radar detection technology is facing a severe challenge, thus the research on radar detection technology of high-speed targets has become increasingly important. To improve the detection performance, traditional pulse Doppler radar usually uses the method of long time pulse accumulation. This paper will focus on the problems of range migration and Doppler spread in the signal processing mentioned above. The main work is as follows:Firstly, this paper establishes the echo signal model of a high-speed target, analyzes the causes of range migration and Doppler spread theoretically, discusses the processing steps for high-speed moving targets’echo signal, and illustrates the problems exist in traditional pulse accumulation methods.Secondly, in order to solve the range migration problem, this paper discusses the corresponding compensation algorithm in two cases, targets with a constant high speed and high-speed targets with a constant acceleration. For the first case, this paper studies multiple sub-band partition algorithm, Keystone transform algorithm and frequency domain compensation algorithm, gives specific steps of algorithm implementation, simulates these algorithms to verify the effectiveness in single-target and multi-target situations, then analyzes and compares the arithmetic computation of each algorithm; for the second case, it analyzes the limitation of conventional compensation methods, then studies a Keystone transform-frequency domain compensation algorithm. To reduce the computational complexity, this paper also proposes an improved method, and the simulation results show that the method is effective.Finally, for the Doppler spread of high-speed targets with constant acceleration, this paper introduces the fractional Fourier transform to realize the parameter estimation of the targets, and does simulation in single-target and multi-target situations respectively. At the same time, it verifies the gradual unbiasedness and efficiency of the algorithm through theoretical analysis.