Tracking accuracy analysis of dynamic programming track before detect algorithm

Abstract

Dynamic programming algorithm is an effective track before detect method. It recovers target trajectory at the same time as the detection is declared after processing several successive frames of measurement. This paper simulates the tracking accuracy of each frame of trajectory which is recovered from the maximum of merit function after executing dynamic programming. Several useful results for improving tracking performance are obtained. First the tracking accuracy of middle frames is higher than both sides. Second the lager SNR and the more possible transition states, the more gentle the curves. Third under the condition of large SNR the more possible transition states, the higher accuracy.