Radar Automatic Target Recognition (RATR) is the key technique to be breaked through in the fuure development of intelligent weapon system. Compared to the 2-D SAR image target recognition, High Resolution Range Profile (HRRP) target recognition has the advantage of low data dimension, low requirement of radar system's calculation and storage ability, and the imaging algorithm is also not complicated. HRRP imaging is the first and the key process in target recognition, its speed and imaging quality can directly influence the real-time capability and accuracy of target recognition. In this paper a new HRRP imaging algorithm — NUFFT algorithm is proposed, the derivation of mathematical expression is given, both for the echo simulation process and the imaging process. In the meantime, by analyzing each step's calculation complexity, we compared the calculation complexity of four different imaging algorithms, we also simulate two target's imaging and target recognition processing. Theoretical analysis and simulation both prove that the proposed algorithm's calculation complexity is improved in various degree compared with the others, thus can be effectively used in target recognition.
Jacobs S P. Automatic target recognition using high-resolution radar range profiles[D]. [Ph.D. dissertation], Washington University, 1999.
[2]
Long T, Li D, and Wu Q Z. Design methods for step frequency waveform and the target pick-up algorithm[J]. Systems Engineering and Electronics, 2001, 23(6): 26-31.
[3]
Li D and Long T. Target's redundance removed algorithms of step frequency radar[J]. Acta Electronica Sinica, 2000, 28(6): 60-63.
[4]
Long T, Han Y, and Mao E. Digital signal processing of stepped frequency radar[J]. Acta Aseronqutica et Astronautica Sinica, 2001, 22(S1): 16-25.
[5]
Bai X, Mao S Y, and Yuan Y N. Time domain synthetic bandwidth methods: A 0.1 m resolution SAR technique[J]. Acta Electronica Sinica, 2006, 34(3): 472-477.
[6]
Wilkinson A J, Lord R T, and Inggs M R. Stepped-frequency processing by reconstruction of target reflectivity spectrum[C]. Proceedings of the 1998 South African Symposium on IEEE Communications and Signal Processing, COMSIG'98, 1998: 101-104.
[7]
Potts D, Steidl G, and Tasche M. Fast Fourier Transforms for Nonequispaced Data: A Turorial[M]. Benedetto J J and Ferreira P, Modern Sampling Theory: Mathmatics and Applications, Boston: Birkhauser, 2001: 247-270..
[8]
Fessler J A and Sutton B P. Nonuniform fast Fourier transforms using min-max interpolation[J]. IEEE Transactions on Signal Processing, 2003, 51(2): 560-574. [9] Dutt A and Rokhlin V. Fast Fourier transforms for nonequispaced data[J]. SIAM Journal on Scientific Computing, 1993, 14(6): 1368-1393.
[10]
Liu Q H and Nguyen N. An accurate algorithm for nonuniform fast Fourier transforms (NUFFT's)[J]. IEEE Microwave and Guided Wave Letters, 1998, 8(1): 18-20.
[11]
Nguyen N and Liu Q H. The regular Fourier matrices and nonuniform fast Fourier transforms[J]. SIAM Journal on Scientific Computing, 1999, 21(1): 283-293.
[12]
Fessler J and Sutton B P. Nonuniform fast Fourier transforms using min-max interpolation[J]. IEEE Transactions on Signal Processing, 2003, 51(2): 560-574.
[13]
Schaller S, Flohr T, and Steffen P. An efficient Fourier method for 3-D radon inversion in exact cone-beam CT reconstruction[J]. IEEE Transactions on Medical Imaging, 1998, 17(2): 244-250.
[14]
Sarty G E, Bennett R, and Cox R W. Direct reconstruction of non-Cartesian k-space data using a nonuniform fast Fourier transform[J]. Magnetic Resonance in Medicine, 2001, 45(5): 908-915.
[15]
Song J, Liu Q H, Kim K, et al.. High-resolution 3-D radar imaging through nonuniform fast Fourier transform (NUFFT)[J]. Communications in Computational Physics, 2006, 1(1): 176-191.
2015, Vol. 4 
